hdu1019 Least Common Multiple

 

Least Common Multiple

 

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

 

 

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

 

 

/*
 * 水题，求两个数的最小公倍数=两数的乘积/两数的最大公约数
 * LCM(a,b)=a*b/gcd(a,b)
 */

 

//
// Created by Admin on 2017/3/28.
//

#include <cstdio>

int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}

int main(){
    int t;
    scanf("%d",&t);
    while (t--){
        int n,a[1010];
        scanf("%d",&n);
        for (int i = 0; i < n; ++i)
            scanf("%d",&a[i]);
        int temp=a[0];
        long long ans=a[0];
        for (int j = 1; j < n; ++j){
            temp=gcd(ans,a[j]);
            ans*=a[j];
            ans/=temp;
        }
        printf("%lld\n",ans);
    }
    return 0;
}