求出最大公约数后可用公式求最小公倍数也可以做
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n, val, num = 0, m;
vector<int> v;
while (cin >> n)
{
m = n;
while (m--&&cin >> val)
v.push_back(val);
}
sort(v.begin(), v.end());
for (int i = v[v.size() - 1];; i++)
{
for (int j = 0; j <= v.size() - 1; j++)
{
if (i%v[j] == 0)
num++;
else
{
num = 0;
break;
}
}
if (num == n)
{
cout << i << endl;
break;
}
}
return 0;
}