一、I - 辗转相除法求最大公约数 HDU - 1019

I - 辗转相除法求最大公约数

HDU - 1019

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

通过求最大公约数来求最小公倍数，对于第n个数来说，如果前n-1个数的最大公约数为w

1.如果w恰好也为这个数的倍数，则计算下一个数

2.如果w不是这个数的倍数，则要求w和第n个数的最小公倍数，更新数列的最小公倍数。

#include <stdio.h>
#include <stdlib.h>

long long yueshu(long long a,long long b)
{
    if(b==0) return a;
    else return yueshu(b,a%b);
}
int main()
{
    int m,n,i,j;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&m);
        long long  a[1000],temp,beishu;
        scanf("%I64d",&a[0]);
        beishu=a[0];
        for(j=1;j<m;j++)
        {
            scanf("%I64d",&a[j]);
            if(beishu%a[j]==0 ) continue;
            else
            {
            	if(beishu<a[j]) temp=yueshu(a[j],beishu);
                else temp=yueshu(beishu,a[j]);
                beishu=beishu*a[j]/temp;
            }
        }
        printf("%I64d\n",beishu);
    }
    return 0;
}