HDU 1019 Least Common Multiple

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 44912    Accepted Submission(s): 16871

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
  
  

题目的大意：先输入一个整数N，然后输入N组数，输入格式为M个和分别对应的M个具体的整数，最后求他们的最小公倍数。思想是从第一个到最后一个整数，从前往后两两求他们的最小公倍数。贴下自己AC的代码：

#include<iostream>
using namespace std;
int max_yue(long int x,long int y)
{
  long	int a=y,b=x;
	if(x%y==0)return y;
	else
	{
		x=a;
		y=b%a;
		max_yue(x,y);
	}
}
int main()
{
	int T,t;  //要判断几组和每组的个数 
	cin>>T;
	while(T--)
	{
	long	int sum=1;
	long	int a;
		cin>>t;
		while(t--) 
		{
			cin>>a;
			sum=sum/max_yue(sum,a)*a;             //之前提交两次没通过，因为之前写成 sum*a/max_yue(sum,a);先乘a可能会出现溢出的情况，要注意 
		}
		cout<<sum<<endl;
	 } 
	 return 0;
 }