HDU-1019 Least Common Multiple

HDU-1019 Least Common Multiple

Time Limit : 2000/1000ms (Java/Other)
Memory Limit : 65536/32768K (Java/Other)
 

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

 
题目网址：http://acm.hdu.edu.cn/showproblem.php?pid=1019
 

分析

题意：题意很简单，求最小公倍数。
 
思路：水题，直接求就可以了。不知道怎么算最小公倍数或者最大公约数的请自行百度。
 

代码

#include <iostream>
#include <stdio.h>
using namespace std;
int gcd(int a,int b)
{
    int x=a%b;
    while (x!=0)
    {
        a=b;
        b=x;
        x=a%b;
    }
    return b;
}
int lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}
int main()
{
    int n,x;
    cin>>n;
    while (n--)
    {
        cin>>x;
        int a;
        int num=1;
        for (int i=0;i<x;i++)
        {
            cin>>a;
            num=lcm(num,a);
        }
        cout<<num<<endl;
    }
    return 0;
}