《算法笔记》codeup 5.2 A

问题 A: Least Common Multiple

时间限制: 1 Sec  内存限制: 32 MB
提交: 467  解决: 216
[提交][状态][讨论版][命题人:外部导入]

题目描述

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
2 3 5
3 4 6 12

样例输出

15
12

#include<cstdio>

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

int mult(int a,int b){
	int x=gcd(a,b);
	return a/x*b;
}


int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
	
	int re[n];
	for(int i=n;i>0;i--){
		int m;
		scanf("%d",&m);
		int st[m];
		for(int j=0;j<m;j++){
		    scanf("%d",&st[j]);		
		}
		int bj=st[0];
		int mul,x;
		for(int j=0;j<m-1;j++){
			bj=mult(bj,st[j+1]);	
		}
		re[n-i]=bj;
	}
	for(int i=0;i<n;i++){
		printf("%d\n",re[i]);
	}
}
    return 0;
}