1019

Least Common Multiple

Problem :     Judge Status : Accepted
RunId : 1324797    Language : C++    Author :
Code Render Status : Rendered By HDOJ C++ Code Rander Version 0.01 Beta

#include 
using namespace std;
__int64 Euclidean (__int64 a, __int64 b) {
    __int64 mul, tem;
    if(a<b) { tem = a; a = b; b = tem;}
    mul = a*b;
    while(( tem = a % b)) { a = b; b = tem;}
    return mul/b;
}
int main() {
    int i, t, n;
    __int64 x, y;
    scanf("%d",&t);
    while(t--) {
        x = 0;
        scanf("%d",&n);
        for( i = 0; i < n; i++) {
            scanf("%I64d",&y);
            if(!i) { x = y; continue;}
            x = Euclidean( x, y);
        }
        printf("%I64d\n",x);
    }
    return 0;
}