Least Common Multiple

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

 23 5 7 156 4 10296 936 1287 792 1 

 

Sample Output

 10510296 

就是一组正整数的最小公倍数（LCM）是最小的正整数，可由集合中的所有数字整除，那么就一个一个来，辗转相除法

#include<stdio.h>int main(){int a,b,c,n,i,m,j,r1,r2,s;scanf("%d",&n);while(n--){scanf("%d%d",&m,&a);    for(j=1;j<m;j++){    r1=a;  scanf("%d",&b);r2=b;while(r2){s=r1%r2;r1=r2;r2=s;}a=a/r1*b;}printf("%d\n",a);}}