【HDU个人赛 未做题】 欧里几得求最大公约数

 

Hint:   此题是在求两个数的基础上求多个数据的最小公倍数，思路是先求两个数的最小公倍数，得到的结果再和第三个数求最小公倍数..........以此类推。值得注意的一点是求最大公约数时用到欧里几得法求取，简单易行     O(∩_∩)O

 

                                            Least Common Multiple 

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

 标程：

     

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int gcd(int a, int b) //欧里几得求最小公约数
{
    if(b == 0)
        return a;
    return gcd(b,a%b);
}
int main()
{
    int n, s, T,a,s1, i;
    scanf("%d",&T);
    while(T--)
    {
        s = s1 = 1;//全部初始化1
        scanf("%d",&n);
        for(i = 0;i < n;i++)
        {
            scanf("%d",&a);
            s = s1/gcd(s1,a)*a; //防止数据的溢出要先除再乘，因为第一个数没有组队的对象，所以用1来凑
            s1 = s;
        }
        printf("%d\n",s);
    }

    return 0;
}