1352: 多个数最小公倍数

多个数的最小公倍数以及辗转相除法求最大公约数

#include <bits/stdc++.h>
using namespace std;
int t;
int num[12];
int gcd(int a,int b){while(b!=0){int temp = a%b;a=b;b=temp;}return a;
}
int lcm(int a,int b){return a/gcd(a,b)*b;
}
int main(){scanf("%d",&t);while(t--){int n;scanf("%d",&n);int ans=1;for(int i=1;i<=n;i++){int b;scanf("%d",&b);ans=lcm(ans,b);}printf("%d\n",ans);}return 0;
}