51nod_1179_計算N個數之間兩兩之間GCD的最大值

#include<iostream> #include<cstdio> using namespace std; const int maxs = 1e6 + 10; int D[maxs]; int main() { int n; cin >> n; long long x,themax = 0; for (int i = 0;i < n;i++) { scanf("%lld", &x); D[

>>阅读原文<<