题意:
给定 n 个数 a [ i ] (2 <= n <= 1e5, a <= a[i] <= 1e6)
求解 max( gcd( a [ i ], a [ j ] ) )(i != j)
思路:
枚举因子 d ,只要找到给定的数列中有大于等于两个书是 d 的倍数,那 d 就满足gcd的条件
给定 n 个数 a [ i ] (2 <= n <= 1e5, a <= a[i] <= 1e6)
求解 max( gcd( a [ i ], a [ j ] ) )(i != j)
思路:
枚举因子 d ,只要找到给定的数列中有大于等于两个书是 d 的倍数,那 d 就满足gcd的条件
找到最大的 d;
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6 + 7, maxd = (1<<18)-1, mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;
int n, max_;
int cnt[maxn];
bool is_ok(int d) {
int num = 0;
for(int i = d; i <= max_; i += d) {
num += cnt[i];
if(num >= 2) break;
}
if(num >= 2) return true;
else return false;
}
int main() {
scanf("%d", &n);
int ans = 0;
max_ = 0;
memset(cnt, 0, sizeof cnt);
for(int i = 0; i < n; ++i) {
int x; scanf("%d", &x);
cnt[x]++;
max_ = max(max_, x);
}
for(int i = max_; i >= 1; --i) {
if(is_ok(i)) { ans = i; break; }
}
cout << ans << endl;
return 0;
}