ACM Least Common Multiple

The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.

 

InputInput will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 ... nm where m is the number of integers in the set and n1 ... nm are the integers. All integers will be positive and lie within the range of a 32-bit integer. 
OutputFor each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer. 
Sample Input

2
3 5 7 15
6 4 10296 936 1287 792 1

Sample Output

105
10296

 #include<bits/stdc++.h>
 using namespace  std;
 long long solve(long long a,long long b)
 {
     long long m,n,c;
     m = a, n = b;
     a = max(m,n);
     b = min(m,n);
     while(b)
     {
         c = a % b;
         a = b;
         b = c;
     }
     return m*n/a;
 }
 int main()
 {
     long long T,n,a,b;
     while(cin>>T)
     {
         while(T--)
         {
             scanf("%d",&n);
             scanf("%d",&a);
             for(int i = ; i < n-; i++)
             {
                 scanf("%d",&b);
                 a = solve(a,b);
             }
             cout<<a<<endl;
         }
     }
     return ;
 }