#include<iostream>#include<cstdio>#include<algorithm>#include<map>
using namespace std;#define ll long long
ll gcd(ll a, ll b){return b ==0? a :gcd(b, a%b);}intmain(){/* freopen("A.txt", "r", stdin); *//* freopen("Ans.txt", "w", stdout); */int n;
cin >> n;longlong g =0;for(int i =0; i < n;++i){longlong x;
cin >> x;
g =gcd(g, x);}int ans =0;for(int i =1; i *1ll* i <= g;++i){if(g % i ==0){++ans;if(i != g / i){++ans;}}}
cout << ans << endl;return0;}
A - Common Divisors CodeForces - 1203C链接????思路求所给n个数的共同最大的公因数,这个共同的最大公因数的数量就是ans这里需要明白一个简单的常识:任意两个数的最大公因数,这个最大公因数的因子,正式这两个数中共同的因子代码#include<iostream>#include<cstdio>#include<algo...