HDU -> acm -> Least Common Multiple

HDU ACM 1019 Least Common Multiple

Least Common Multiple

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18363    Accepted Submission(s): 6840

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

 

#include <stdio.h>
#include <stdlib.h>
int gcd(int a, int b)   // --欧几里得算法求最大公约数
{
    if(b == 0)
        return a;
    return gcd(b, a % b);
}
int main()
{
    int n;
    scanf("%d", &n);  
    while(n--)
    {
        int member, i, max = 0;
        scanf("%d", &member);
        if(member == 1)    // 分类讨论： 如果只输入一个数
        {
            int k;
            scanf("%d", &k);
            printf("%d\n", k);
        }
        else
            if(member == 2)  // 如果输入多个数
        {
            int a, b;
            scanf("%d %d", &a, &b);
            printf("%d\n",(a / gcd(a,b) * b));  // a , b的最小公倍数 = a * b / 最大公约数
                                                //这里先除后乘是为了防止数据溢出

        }
        else             // 如果输入多个数
        {
            int a[member - 1];      //数组储存需要求最小公倍数元素个数
            for(i = 0; i < member; i++)
            {
                scanf("%d", &a[i]);
            }
            max = a[0] / gcd(a[0], a[0 + 1]) * a[0 + 1]; //先求出第一第二个数的最小公倍数
            for(i = 2; i < member; i++)
            {
                max = max / gcd(max, a[i]) * a[i];    
            }
            printf("%d\n", max);
        }
    }
    return 0;
}