CDZSC_2015寒假新人（2）——数学 A

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

 

 题解 ：简单的LCM，见代码。

 

#include <cstdio>
#include <cstring>
#include <cmath>
#define LL long long

LL gcd(LL a, LL b)
{
    LL r = b;
    while (r)
    {
        r = a % b;
        a = b;
        b = r;
    }
    return a;
}

LL lcm(LL a, LL b)
{
    return a * b / gcd(a, b);
}

int main()
{
#ifdef CDZSC_OFFLINE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    int t, n;
    LL a, b;
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d%lld", &n, &a);
        while (--n)
        {
            scanf("%lld", &b);
            a = lcm(a, b);
        }
        printf("%lld\n", a);
    }
    return 0;
}