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

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


 1 2 3 4 5 6  int gcd(int x,int y) { if(y>x) swap(x,y); if(x%y==0) return y; else return gcd(y,x%y); } 

AC代码如下：

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33  #include using namespace std; int gcd(int x,int y) { if(y>x) swap(x,y); if(x%y==0) return y; else return gcd(y,x%y); } long long lcm(int x,int y) { return x/gcd(x,y)*y; } int main() { int n; cin>>n; while(n--) { int len,begin; cin>>len; cin>>begin; int ans=begin,k; len--; while(len--) { cin>>k; ans=lcm(ans,k); } cout<