Common Divisors CodeForces - 1203C

You are given an array a consisting of n integers.
Your task is to say the number of such positive integers x such that x divides each number from the array. In other words, you have to find the number of common divisors of all elements in the array.
For example, if the array a will be [2,4,6,2,10], then 1 and 2 divide each number from the array (so the answer for this test is 2).

Input
The first line of the input contains one integer n (1≤n≤4⋅105) — the number of elements in a.
The second line of the input contains n integers a1,a2,…,an (1≤ai≤1012), where ai is the i-th element of a.

Output
Print one integer — the number of such positive integers x such that x divides each number from the given array (in other words, the answer is the number of common divisors of all elements in the array).

Examples
Input
5
1 2 3 4 5
Output
1
Input
6
6 90 12 18 30 18
Output
4

题意:求数组中所有数的公约数，统计有多少个这样的公约数。暴力求解所有数的最大公约数，然后对最大公约数分解其约数，这些约数都可以满足条件的。

#include<iostream>
using namespace std;
typedef long long ll;
const int N=4e5+10;
int n;
ll a[N];
ll max_gcd(ll a,ll b)
{
	if(b==0) return a;
	return  max_gcd(b,a%b);
}
int  main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
	ll res=a[1];
	for(int i=2;i<=n;i++)	res=max_gcd(res,a[i]);
	ll cnt=0;
	for(ll i=1;i<=res/i;i++)
	{
		if(res%i==0)
		{
			if(res/i==i)  cnt++; //例如9/3=3的这种情况，只能算一个。
			else cnt+=2;
		}
	}
	printf("%lld\n",cnt);
}