hdoj 1019Least Common Multiple

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 52253    Accepted Submission(s): 19833

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

  
  

   
   
10296
题意：找出n个数的最小公倍数
代码：
   
   
#include<cstdio>

typedef long long LL;
LL LCM(LL a,LL b){//到达一定程度会超出int型范围
	LL c,a1=a,b1=b;
	while((c=a1%b1)!=0){
		a1=b1;
		b1=c;
	}
	return a*b/b1;
}

int s[10000001];

int main(){
	int T;
	
	scanf("%d",&T);
	while(T--){
		int n;
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d",&s[i]);
		}
		LL temp=s[1];
		for(int i=2;i<=n;i++){
			temp=LCM(temp,s[i]);
		}
		printf("%lld\n",temp);
	}
	return 0;
}