HDU ACM1019——Least Common Multiple

Least Common Multiple

Problem Description

The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.

Input

Input will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 … nm where m is the number of integers in the set and n1 … nm are the integers. All integers will be positive and lie within the range of a 32-bit integer.

Output

For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.

Sample Input

2
3 5 7 15
6 4 10296 936 1287 792 1

Sample Output

105
10296

题目大意：就是求所给数字的最小公倍数。
与求最小公因数那题（HDU ACM1014）相仿，直接看代码吧。

#include<stdio.h>
int fun (long long x, long long y)            
{
    long long temp, r, large, small;
    if (x < y){     //保持x比y大，好计算 
        temp = y;
        y = x;
        x = temp;
    }
    large = x;
    small = y;
    while ((r = x % y) > 0){    //求最大公因数 
        x = y;
        y = r;
    }
    return large * small / y;   //两数相乘除以其最大公因数即为最小公倍数 
}
int main()
{
    long long N,n,i,a,LCM;
    scanf("%lld",&N);
        while(N--){
            scanf("%lld",&n);
            LCM=1;
            for(i=1;i<=n;i++){
                scanf("%lld",&a);
                LCM=fun(LCM,a);
            }
            printf("%lld\n",LCM);
        }
    return 0;
}