求多个数的最小公倍数

C - Least Common Multiple

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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 <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#define MAX 100000


using namespace std;


int lcm(int a,int b)//判断a，b两个数是否互素，如果互素则返回1，否则返回两个数的最大公约数，当两个数互素，最
{                   //大公约数为1
	int r;
	while(b)
	{
		r=a%b;
		a=b;
		b=r;
	}
	return a;
}
int main()
{
	int n,m,a,b,cnt;
	cin>>n;
	while(n--)
	{
		cin>>m;
		cnt=a=1;
		for(int i=0;i<m;i++)
		{
			cin>>b;
			cnt=a/lcm(a,b)*b;//最小公倍数=两个数的乘积/最大公约数
			a=cnt;
		}
		cout<<cnt<<endl;
	}
}