hdu 2028 Lowest Common Multiple Plus

#include<iostream>
using namespace std;
int gcd(int x,int y)
{
    int tem;
    if(x<y)
    {
	    tem=x;
        x=y;
        y=tem;
    }
    int r=x%y;
    while(r!=0)
    {
	    x=y;
        y=r;
        r=x%y;
    }
	return y;
}
int main()
{
    int n;
    long*num;
    long long tem;
    long long result;
    while(cin>>n)
    {
	    num=new long[n];
        for(int i=0;i<n;i++)
        cin>>num[i];
        tem=gcd(num[0],num[1]);
        result=num[0]*num[1]/tem;
        for(int i=2;i<n;i++)
        {
		    tem=gcd(result,num[i]);
            result=result*num[i]/tem;
        }
        cout<<result<<endl; 
        delete[] num;
    }
    return 0;
}