hdu1019 Least Common Multiple

#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
int gcd(int a,int b){// a-15 b-6
    int c=1,t;
    if(a<b)        {t=a,a=b,b=t;}
    while(c!=0){
        c=a%b;
        a=b;
        b=c;
    }
    return a;
}
int main(){
    int t,i,j,n;
    int temp,res;
    while(~scanf("%d",&t)){
        while(t--){
            scanf("%d",&n);
            scanf("%d",&res);
            n--;
            while(n--){
                scanf("%d",&temp);
                res=temp/( gcd(temp,res) )*res;
            }
            printf("%d
",res);
        }
    }
    return 0;
}