Codeforces Round #579 (Div. 3) 1203C. Common Divisors Solution

 

Problem Link:  https://codeforces.com/contest/1203/problem/C

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include<bits/stdc++.h>

using namespace std;

#define ll long long

int main()

{

    ll n,i,j,g,dvc=0;

    cin>>n;

    ll ar[n];

    cin>>ar[0];

    g=ar[0];

    for(i=1; i<n; i++)

    {

        cin>>ar[i];

        g=__gcd(g,ar[i]);

    }

    for(i=1; i*i<=g; i++)

    {

        if(g%i==0)

        {

            if(i*i!=g)

                dvc+=2;

            else

                dvc++;

        }

    }

    cout<<dvc<<endl;

}