Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 37737 Accepted Submission(s): 14199
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 f(int w,int b)
{
if(b==0)
return w;
return f(b,w%b);
}
main()
{
int b,j,i,x[190],n;
__int64 max,a;
scanf("%d",&n);
while(n--)
{
scanf("%d",&b);
a=1;
for(i=0;i<b;i++)
{
scanf("%d",&x[i]);
if(x[i]==0)
continue;
max=(x[i]*a)/f(x[i],a);
a=max;
}
printf("%I64d\n",max);
}
return 0;
}Least Common Multiple
原文：http://blog.csdn.net/l15738519366/article/details/46279501
