Least Common Multiple

Least Common Multiple

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

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
  
  

 

Source

East Central North America 2003, Practice

 

http://acm.hdu.edu.cn/showproblem.php?pid=1019

#include <cstdio>
#include <algorithm>
using namespace std;
int GCD(int a,int b){
    if(a%b==0)return b;
    else return GCD(b,a%b);
}
int main()
{
    int n;
    scanf("%d",&n);
    while(n--){
        int m,ans=1,y=1;
        scanf("%d",&m);
        while(m--){
            int x;
            scanf("%d",&x);
            if(x==0)continue;
            ans=ans/GCD(x,ans)*x;//代码一开始是WA了，后来看了下某大神的代码，发现这里先乘会溢出；
        }
        printf("%d\n",ans);
    }
    return 0;
}