Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50302 Accepted Submission(s): 19096
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个数的最小公倍数。
大致思路:
1)先求两个数的最小公倍数,再求所得结果与下一个数的最小公倍数。循环完所有的数所得的结果就是答案。
2)两个数的最小公倍数=两个数的乘积/最大公因数。
3)辗转相除法求最大公因数。
int gcd ( int x , int y )
{
return b==0 ? a : gcd(b,a%b) ;
}
4)需要注意的一点:求两个数的最小公倍数时,先用较大数除以最小公因数,在乘以较小数。否则int容易爆。
#include<cstdio>
#include<algorithm>
int gcd(int x,int y)
{
return y>0?gcd(y,x%y):x;
}
int main()
{
//freopen("in.txt","r",stdin);
int n,m,i,t,k;
scanf("%d",&n);
while(n--){
scanf("%d",&m);
scanf("%d",&t);
m--;
while(m--){
scanf("%d",&k);
t=(t>k?t:k)/gcd(t,k)*(t>k?k:t);
}
printf("%d\n",t);
}
return 0;
}