Least Common Muliple

题目：一个集合的最小公倍数

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>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <stack>
using namespace std;

long long gcd(long long a,long long b){
    if(b==0) return a;
    return gcd(b,a%b);
}

long long lcm(long long a,long long b){
    return a*b / gcd(a,b);
}


int main(){
    int t;
    int m;
    long long a,b;
    cin >> t;
    for(int k=0;k<t;k++){
        cin >> m;
        cin >> a;
        for(int i=1;i<m;i++){
            cin >> b;
            a = lcm(a,b);
        }
        cout << a << endl;
    }
}