Least Common Multiple hdu 1019

#include <iostream>

#include <cmath>
#include <algorithm>
#define ll long long
using namespace std;


ll gcd(ll a,ll b)
{?
? ?ll t1=max(a,b);
? ?ll t2=min(a,b);
? ?while(b)
? ?{
   ll tp=a%b;
   ? a=b;
   ? b=tp;
? ?}
? ?return a;
}
ll lcm(ll a,ll b)
{
 return a*b/gcd(a,b);?
}
int main()
{
 ll T,n,c,d;
 cin>>T;
 while(T--)?
 {
 cin>>n>>c;
 n--;
 while(n--)
  ?{
    ?cin>>d;
    c=lcm(c,d);
  ?}
  ?printf("%lld\n",c);
 }
 return 0;
}