杭电acm2028Lowest Common Multiple Plus

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long gcd(long long a,long long b)//求a和b的最大公约数
{
	long long temp;
	if(a<b)
	{
		temp = a;
		a = b;
		b = temp;
	}
	long long r=a%b;
	while(r!=0)
	{
		a = b;
		b = r;
		r = a%b; 
	}
	return b;
}
int main()
{
    int n;
    long long a[1005];
    long long sum;
    while(cin>>n)
    {
    	for(int i=0;i<n;i++)
    	{
    		cin>>a[i];
	}
		sum=a[0];
		for(int i=1;i<n;i++)
		{
			sum=sum/gcd(sum,a[i])*a[i];
		}
		cout<<sum<<endl;
	}
	return 0;
}