题意:
多个数求LCM
思路:
边输边求
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b)
{
return b == 0 ? a : gcd(b, a % b);
}
int main(){
int t;
cin>>t;
while(t--){
int m;
cin>>m;
ll ans=1,x;
for(int i=0;i<m;i++){
cin>>x;
ans=(ans*x)/gcd(ans,x);
}
printf("%lld\n",ans);
}
return 0;
}