1019 Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 51959    Accepted Submission(s): 19706

 

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>
 using namespace std;
 long long  gcd(long long  c,long long  b)
 {
     return b? gcd(b,c%b):c;
 }
 int main()
 {
     int t;
     cin>>t;
     while(t--)
     {
         int n;
         long long a[];
         cin>>n;
         for(int i=;i<n;i++)
         {
             cin>>a[i];
         }
         for(int i=;i<n;i++)
         {
             a[i]=a[i]*a[i-]/gcd(a[i],a[i-]);
         }
         cout<<a[n-]<<endl;
     }
     return ;
  } 

求最大公约数代码:

long long  gcd(long long  c,long long  b)
{
    return b? gcd(b,c%b):c;
}