Least Common Multiple

Problem Description

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.<br><br>
 ```

##Input

Input 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.

##Output

For 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<stdio.h>  
#include<stdlib.h>  
int gcd(int a,int b)//辗转相除法
{
    int t;
    if (a<b)
    {
        t = a;
        a = b;
        b = t;  
    } 
    while(b)
    {
        t = b;
        b = a%b;
        a = t;
    }
    return a;
}
int lcm(int a,int b)
{
    int ans=1;
    ans = a/gcd(a,b)*b;
    return ans;
}


int main()
{  
    int time,a,n,i,ans;
    scanf("%d",&time);
    while(time--)
    {
        scanf("%d",&a);
        for(i=0;i<a;i++)
        {
            scanf("%d",&n);
            if (i==0)   
                ans = lcm(1,n);
            else
                ans = lcm(ans,n);
        }
        printf("%d\n",ans);
    }
   return 0;
}