HDU 1019 Least Common Multiple（数学 多个数求LCM）

Least Common Multiple
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 62154 Accepted Submission(s): 23735

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<bits/stdc++.h>
#define LL long long
using namespace std;
LL GCD(LL a,LL b)
{
    return a==0?b:GCD(b%a,a);
}
LL LCM(LL a,LL b)
{
    LL temp=GCD(a,b);
    return a*b/temp;
}
int main()
{
    int t; cin>>t;
    while(t--)
    {
        int n; cin>>n;
        LL num[n],res=1;
        for(int i=0;i<n;i++)
        {
            cin>>num[i];
            res=LCM(res,num[i]);
        }
        cout<<res<<endl;
    }
    return 0;
}