# HDOJ--Least Common Multiple

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 <iostream>
#include <vector>
using namespace std;

int gcd(int a, int b)
{
if (b == 0)return a;
return gcd(b, a%b);
}

int main()
{
int n;
cin >> n;
for (int ii = 0; ii < n; ++ii)
{
int count = 0;
cin >> count;
int result = 1;
int a = 1;
for (int i = 0; i < count; ++i)
{
int b;
cin >> b;
result = a / gcd(a, b)*b;       //怕溢出，所以先除gcd再乘
a = result;
}
cout << result << endl;

}
return 0;
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：HDOJ--Least Common Multiple 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)