HDOJ1019Least Common Multiple

Least Common Multiple

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

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
  
  

 

//求几个数的最小公倍数，先求前两个数的最小公倍数，再求这两个数的最小公倍数和下一个数的最小公倍数 
//以此求解出几个数的最小公倍数
#include<stdio.h>
int gcd(int a,int b)
{
	if (a<b)
	{
		int t=a;
		a=b;
		b=t;
	}
	if (b==0)
	{
		return a;
	}
	return gcd(b,a%b);
}
int main()
{
	int n,m;
	long long a[10101],sum;
	scanf ("%d",&n);
	while (n--)
	{
		scanf ("%d",&m);
		//sum=0;
		for (int i=0;i<m;i++)
		{
			scanf ("%d",&a[i]);	
		}
		sum=a[0];
		
		for (int j=0;j<m;j++)
		{
			sum=(a[j]*sum)/gcd(sum,a[j]);
		}
		printf ("%d\n",sum);
	 } 
	return 0;
 }