Least Common MultipleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62762 Accepted Submission(s): 23994 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>
#include<cstring>
using namespace std;
int gcd(int a,int b) //寻找最大公约数
{
if(!b)
return a;
return gcd(b,a%b);
}
int main()
{
int t;
cin>>t;
while(t--)
{
int n,a=1,G,x;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
G=a/gcd(a,x)*x;
a=G; //最小公倍数。
}
printf("%d\n",a);
}
}