hdu 1059最小公倍数模板

题目链接 点击打开链接

#include <iostream>#include<cstdio>using namespace std;int gca(int a,int b){    if(a<b){        int t=a;        a=b;        b=t;    }    while(b!=0){        int c=a%b;        a=b;        b=c;    }    return a;}int main(){    //freopen("in.txt","r",stdin);    int c,n,a,b;    cin>>c;    while(c--){        cin>>n;        cin>>a;        for(int i=1;i<n;++i){            cin>>b;            a=a/gca(a,b)*b;        }        cout<<a<<endl;    }    return 0;}