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.

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

程序代码：

#include<stdio.h>
int gcd(int a,int b)
{
  return b?gcd(b,a%b):a;//递归求两个数的最大公约数 
}
int lcm(int a,int b)
{
  return a/gcd(a,b)*b;//这里先除后乘求最小公倍数，更好的避免数据溢出 
}
int main()
{
  int t,n,a,b;
  scanf("%d",&t);
  while(t--)
  {
    scanf("%d",&n);
    scanf("%d",&a);
    for(int i=1;i<n;i++)
    {
      scanf("%d",&b);
      a=lcm(a,b);
    }
    printf("%d\n",a);
  }
  return 0;
}