< 返回

# Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20759    Accepted Submission(s): 7738 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
1. #include<iostream>
2. #include<cstdio>
3. using namespace std;
4. int a;
5. int gcd(int a,int b)
6. {
7. if(b==0)
8. return a;
9.  return gcd(b,a%b);
10. }
11. int lcm(int a,int b)
12. {
13.  return a/gcd(a,b)*b; }
14. int main()
15. {
16.  int i,j,t;
17. scanf("%d",&t);
18.  while(t--)
19.  {
20.  int temp,n;
21.   scanf("%d",&n);
22.   for(i=0;i<n;i++)
23.  {
24. scanf("%d",&a[i]);
25.   }
26.   temp=a;
27.  for(i=1;i<n;i++)
28.   {
29.   temp=lcm(temp,a[i]);
30.   }
31. printf("%d ",temp);
32.     }
33. return 0;
34. }

/template/Home/DawnNew/PC/Static