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): 65130 Accepted Submission(s): 24826

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

题目简述：

给出一组数，算出他们的最小公倍数

题目分析：

辗转相除法一个一个算应该可以吧

代码实现：

#include<bits/stdc++.h>
using namespace std;


long long gbs(long long a,long long b)
{
    if(a<b)
        swap(a,b);
    long long t,a0=a,b0=b;
    while(b)
    {
        t=a;
        a=b;
        b=t%b;
    }
    return a0*b0/a;
}

int main()
{
    int T,n,t;
    long long sum;
    scanf("%d",&T);
    while(T--)
    {
        sum=1;
        scanf("%d",&n);
        while(n--)
        {
            scanf("%d",&t);
            sum=gbs(sum,t);
        }
        printf("%lld\n",sum);
    }
}