Submission #1217038

#TimeUsernameProblemLanguageResultExecution timeMemory
1217038sam230609Cloud Computing (CEOI18_clo)C++20
0 / 100
1 ms328 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 2e5;

int arr[200001];

int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	for (int i = 0; i < n; i++) { cin >> arr[i]; }

	int ans = 1;
	for (int i = 0; i < n - 1; i++) {
		for (int j = i + 1; j < n; j++) { ans = max(ans, gcd(arr[i], arr[j])); }
	}
	cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...