hdu 1019最小公倍数

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<cstdlib>
using namespace std;
int a[1000001];
int GCD(int m,int n){
if(m>n) swap(m,n);
int r=n,a,b;
while(m>0){
r=n%m;
n=m;
m=r;
}
return n;
}
int main(){
int i,j,k,m,n,d,d1,p;
cin>>n;
while(n--){
cin>>m;
cin>>d;
for(i=0;i<m-1;i++){
cin>>d1;
p=GCD(d,d1);
d=d1/p*d;
}
cout<<d<<endl;
}
return 0;
}