hdu 1019 Least Common Multiple 最小公倍数

AC代码：

#include<cstdio>
#include<cstring>
using namespace std;

int gcd(int a, int b){
    int x;
    x = a % b;
    while(x != 0){
        a = b;
        b = x;
        x = a % b;
    }
    return b;
}
int lcm(int a, int b){
    return a / gcd(a, b) * b;   //先除后乘防止溢出 
} 
int a;
int main(){
    int t;
    scanf("%d", &t);
    while(t--){
        int n, ans = 1;
        scanf("%d", &n);
        int i;
        for(i = 0; i < n; i++){      
            scanf("%d", &a);            
            ans = lcm(ans, a);    //两两求最小公倍数 
        } 
            printf("%d\n", ans);            
    }
    return 0;
}