Problem - 389A Fox and Number Game


 
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#define sf scanf
#define pf printf
#define sfint scanf ("%d %d",&a,&b)
#define sfl scanf ("%ld %ld",&a,&b)

#define sfd scanf ("%lf %lf",&a,&b)
#define sff scanf ("%f %f",&a,&b)
#define lp1(i,n) for(i=0;i<n;i++)
#define lp2(i,n) for(i=1;i<=n;i++)
#define LL long long
#define L long
#define mem(c,v) memset(c,v,sizeof(c))
#define ui unsigned int
#define ull unsigned long long int
#define nl puts("")
#define sq(x) ((x)*(x))
#define MX 1000005
#define N 100
#define MOD 10000000007
#define pb push_back
#define pi acos(-1.0)
#define sz size()
#define gc getchar ()
#define ps push
#define clr clear
#define bn begin()
#define ed end()

using namespace std;

int gcd(int a, int b)
{
   return b == 0 ? a : gcd(b, a % b);
}

int main()
{
    int n,i,ans,mini=MX,j;
    vector <int> v;
    cin >> n;
    lp1(i,n)
    {
        int x;
        cin >> x;
        v.push_back(x);
    }

    sort(v.begin(),v.end());

    int vlen=v.size();

    //    for(i=0;i<vlen;i++)
    //    {
    //        for(j=i;j<vlen;j++)
    //        {
    //            ans=gcd(v[i],v[j]);
    //            mini=min(mini,ans);
    //        }
    //    }
    ans=gcd(v[0],v[1]);

    for(i=1;i<vlen;i++)
    {
        ans=gcd(v[i],ans);
        mini=min(ans,mini);
    }
    //cout << mini << endl;
    mini*=n;
    cout << mini;
    v.clear();
    return 0;
}


Comments

Popular posts from this blog

SPOJ-CMG - Collecting Mango

LeetCode Palindrome Number

Hacker Rank The Power Sum