hdu 1019 Least Common Multiple

Least Common Multiple

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

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

 

Source

East Central North America 2003, Practice

 

Recommend

JGShining   |   We have carefully selected several similar problems for you:  1071 1170 1032 1022 1028 

 

数学题，可以说得上一个模板吧。

 

题意：求多个数的最小公倍数。

 

附上代码：

#include <iostream>
#include <cstdio>
using namespace std;
int add(int a,int b)
{
    int c;
    while(b!=0)
    {
        c=a%b;
        a=b;
        b=c;
    }
    return a;
}
int main()
{
    int n,m,i,t,s,k;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&m);
        scanf("%d",&k);
        for(i=1; i<m; i++)
        {
            scanf("%d",&s);
            t=add(k,s);
            k=k/t*s;
        }
        printf("%d
",k);
    }
    return 0;
}