题目1439：Least Common Multiple 九度OJ

题目1439：Least Common Multiple

时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：5944

解决：1771

题目描述：

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

输出：

For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.

样例输入：

2
3 5 7 15
6 4 10296 936 1287 792 1

样例输出：

105
10296

#include <cstdio>

int gcd(long long a,long long b){
	if(b==0)return a;
	else gcd(b,a%b);
}

int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
		while(n--){
			int m;
			scanf("%d",&m);
			long long a,b;
			scanf("%lld",&a);
			m--;
			while(m--){
				scanf("%lld",&b);
				a=a*b/gcd(a,b);
			}
			printf("%lld\n",a);
		}
	}
	return 0;
}

注意题中所说的32-bit integer, 是unsigned