HDU1019

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

 

 

 

2. #include<iostream>
4. #include<cstdio>
6. using namespace std;
8. int a[10000];
10. int gcd(int a,int b)
12. {  
14. if(b==0)   
16. return a;
18.  return gcd(b,a%b);
20. }
22. int lcm(int a,int b)
24. {
26.  return a/gcd(a,b)*b; }
28. int main()
30. {
32.  int i,j,t;  
34. scanf("%d",&t);
36.  while(t--)
38.  {  
40.  int temp,n;
42.   scanf("%d",&n);
44.   for(i=0;i<n;i++)  
46.  {    
48. scanf("%d",&a[i]);
50.   }
52.   temp=a[0];  
54.  for(i=1;i<n;i++)
56.   {
58.   temp=lcm(temp,a[i]);
60.   }   
62. printf("%d\n",temp);
64.     }   
66. return 0;
68. }