1019 Least Common Multiple

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19851    Accepted Submission(s): 7402

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

 

Sample Output

105
10296

 

 

 

#include<stdio.h>
long LCM(long x, long y)
{
 long z,m,n;
 m=x;
 n=y;
 while(y!=0)
 {
  z=x%y;
  x=y;
  y=z;
 }
 return m/x*n;
}
int main()
{
 long i,j,n,m,num,number;
 scanf("%d",&n);
 for(i=0;i<n;i++)
 {
  scanf("%d",&m);
  number=1;
  for(j=0;j<m;j++)
  {
   scanf("%d",&num);
   number=LCM(number,num);
  }
  printf("%d\n",number);
 }
 return 0;
}