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

23 5 7 156 4 10296 936 1287 792 1

 

Sample Output

10510296

#include<stdio.h>
int yueshu(int a,int b)
{
    int r;
    int temp;
    if(a<b)
    {
        temp=a;
        a=b;
        b=temp;
    }

    while(a%b!=0)
    {
        r=a%b;
        a=b;
        b=r;
    }

    return b;
}
int beishu(int a,int b)
{
    int yue;
    yue=yueshu(a,b);

    return (a/yue)*(b/yue)*yue;
}
int main()
{
    int a[50];
    int n;
    int i;
    int x,t;

    scanf("%d",&t);

    while(t--)
    {
        scanf("%d",&n);

        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }

        if(n==1)
        {
            printf("%d\n",a[0]);
            continue;
        }

        x=beishu(a[0],a[1]);

        for(i=2;i<n;i++)
        {
            x=beishu(x,a[i]);
        }

        printf("%d\n",x);
    }
    return 0;
}