题目1439：Least Common Multiple

#include "iostream"
#include "stdio.h"
#include <vector>
#include <cstring>
#include <algorithm>
#include <string>
#include <string.h>
#include <stack>
#include <ctype.h>
#include <functional>
using namespace std;
//1439
int n,ans,t,m;
vector<int> v;
int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}
int lcm(int a,int b){
    return a/gcd(a,b)*b; //先除后乘避免溢出
}
int main(){
    //freopen("input.txt","r",stdin);
    while(scanf("%d",&n)!=EOF){
        while(n--){
            v.clear();
            scanf("%d",&m);
            if(m==0){
                printf("0\n");
                continue;
            }
            if(m==1){
                scanf("%d",&t);
                printf("%d\n",t);
                continue;
            }
            while(m--){
                scanf("%d",&t);
                v.push_back(t);
            }
            sort(v.begin(),v.end(),greater<int>());
            ans=lcm(v[0],v[1]);
            for(int i=2;i<v.size();i++)
                if(ans%v[i]!=0)
                    ans=lcm(ans,v[i]);
            printf("%d\n",ans);
        }
    }
    return 0;
}
/**************************************************************
    Problem: 1439
    User: cust123
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1520 kb
****************************************************************/