HDOJ 1019 Least Common Multiple 最小公倍数 LCM

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

题目大意：
求m个数的最小公倍数

解题思路：
a、b两数的最小公倍数为两数的乘积除以它们的最大公约数。
小技巧：
通过最大公约数求最小公倍数的时候，先除再乘，避免溢出。

AC代码：

#include<iostream>
using namespace std;

int gcd(int a, int b) {
	return b == 0 ? a : gcd(b, a%b);
}
int main() {
	int n;
	cin >> n;
	while (n--) {
		int m, nn, mm;
		int l = 1;
		cin >> m;
		while (m--) {
			cin >> nn;
			mm = gcd(nn, l);
			l = nn / mm * l;
		}
		cout << l << endl;
	}
	//system("pause");
}