/*
2
3 5 7 15
6 4 10296 936 1287 792 1
105
10296*/
#include<stdio.h>
int gcd(int a,int b){
return b==0?a:gcd(b,a%b);
}
int lcm(int a,int b){
return a*b/gcd(a,b);
}
int main(){
int T,n,i;
while(~scanf("%d",&T)){
while(T--){
scanf("%d",&n);
int ans=1;
while(n--){
int x;
scanf("%d",&x);
ans = lcm(ans,x);
}
printf("%d\n",ans);
}
}
return 0;
}
九度OJLeast Common Multiple 1439
最新推荐文章于 2020-04-02 18:26:50 发布