杭电1019

Least Common Multiple

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


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 <iostream>
using namespace std;

int run(int x,int y)
{
	int i,s;
	for (i=x<y?x:y;i>=1;i--)
	{
		if(x%i==0 && y%i==0) break;
	}
    s=(x/i)*y;
	return s;
}

int main()
{
   int m,n,x[10000],i;
   cin>>m;
   while (m--)
   {
	   cin>>n;
	   for(i=0;i<n;i++)
	   {
		   cin>>x[i];
	   }
	   for(i=0;i<n-1;i++)
	   {
          x[i+1]=run(x[i],x[i+1]);
	   }
	   cout<<x[i]<<endl;
   }
   return 0;
}