HDU 2028 Lowest Common Multiple Plus

#include <bits/stdc++.h>

using namespace std;

const int maxn=1e5+10;
int a[maxn];

long long int gcd(long long int a,long long int b)
{
    long long int c = a%b;
    while(c)
    {
        a = b;
        b = c;
        c = a % b;
    }
    return b;
}

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        long long int asd=1;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
            asd=asd*a[i]/gcd(asd,a[i]);
        }
        printf("%lld\n",asd);
    }
    return 0;
}