1019 Least Common Multiple

 1 #include<iostream>
 2 using namespace std;
 3 long long  gcd(long long  c,long long  b)  
 4 {  
 5     return b? gcd(b,c%b):c;  
 6 } 
 7 int main()
 8 {
 9     int t;
10     cin>>t;
11     while(t--)
12     {
13         int n;
14         long long a[10000];
15         cin>>n;
16         for(int i=0;i<n;i++)
17         {
18             cin>>a[i];
19         }
20         for(int i=1;i<n;i++)
21         {
22             a[i]=a[i]*a[i-1]/gcd(a[i],a[i-1]);
23         }
24         cout<<a[n-1]<<endl;
25     }
26     return 0;
27  } 

long long  gcd(long long  c,long long  b)  
{  
    return b? gcd(b,c%b):c;  
}