cf#579 C

http://codeforces.com/contest/1203/problem/C
C. Common Divisors
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
inputCopy
5
1 2 3 4 5
outputCopy
1
inputCopy
6
6 90 12 18 30 18
outputCopy
4
先用欧几里得函数得到最大公约数，再遍历一次得到最大公约数的约数

#include<stdio.h>
typedef long long LL; 
LL gcd(LL a,LL b) 
{    
    return b==0 ? a :gcd(b,a%b);
}
int main()
{
	int n;
	LL tmp,ans;
	scanf("%d%I64d",&n,&ans);
	n--;
	while(n--)
	{
		scanf("%I64d",&tmp);
		ans=gcd(ans,tmp);
	}
	int cnt=0;
	LL i;
	for(i=1;i*i<=ans;i++)
	{
		if(ans%i==0)
		cnt+=2;
	}
	if((i-1)*(i-1)==ans)
	cnt--;
	printf("%d\n",cnt);
}