HDU 1019

又是一个坑题，注意求最小公倍数时先除后乘，不然会超范围，然后就wa....

/*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<iostream>
#include<algorithm>
using namespace std;
int gbs(int a,int b)
{
    int t;
    int t1=a,t2=b;
    if(a<b)
    {
        swap(a,b);
    }
    while(t=a%b)
    {
        a=b;
        b=t;
    }
    return t1/b*t2;
}
int main()
{
    int n,a[1000],t;
    cin>>t;
    while(t--)
    {
        cin>>n;

            int te;
            for(int i=0; i<n; i++)
            {
                cin>>a[i];
                if(i==0)
                    te=a[i];
                else
                    te=gbs(te,a[i]);
            }
            cout<<te<<endl;

    }
}

转载于:https://www.cnblogs.com/dillydally/p/9567832.html