杭电OJ 1019 Least Common Multiple

求最小公倍数

#include <iostream>
#include <vector>
using namespace std;
int minMul(int a, int b)
{
	if (b < a)
		swap(a, b);
	for (int i = a; i >= 1;i--)
		if (b%i == 0&&a%i==0)
		{
		int mul = b / i*a;
		return mul;
		}
}
int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int n;
		cin >> n;
		vector<int> vec(n);
		for (int i = 0; i < n; i++)
			cin >> vec[i];
		int num = vec[0];
		for (int i = 1; i < n; i++)
			num = minMul(num, vec[i]);
		cout << num << endl;
	}
}