Codeforces--1203C--Common Divisors

题目描述：
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).
输入描述:
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.
输出描述:
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).
输入：
5
1 2 3 4 5
6
6 90 12 18 30 18
输出：
1
4
题意：
给你一个数组 找出这个数组的公约数的数量
题解：
求出所有数的gcd，然后算他们的约数就好了
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;

typedef long long ll;
const int maxn = 400000 + 5;
ll a[maxn];

ll gcd(ll a,ll b){
    if(b==0)
        return a;
    else
        return gcd(b,a % b);
}

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        int minn = maxn;
        for(int i = 1; i <= n; i ++){
            scanf("%lld",&a[i]);
        }
        ll g = a[1];
        for(int i = 2; i <= n; i ++){
            g = gcd(g,a[i]);
        }
        //cout<<g<<endl;
        int ans = 0;
        for(ll i = 1; i * i<= g; i ++){
            if(g % i == 0){
                ans ++;
                if (i * i != g)
                    ans ++;
            }

        }
        printf("%d\n",ans);
    }
    return 0;
}