话不多说,直接上代码,学习求最大公约数和最小公倍数的方法。
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<vector>
#include<map>
using namespace std;
int gcd(int a, int b){
if (a%b == 0)return b;
return gcd(b, a%b);
}
int lcm(int a, int b){
return a / gcd(a, b)*b;
}
int main(){
int n;
while (cin >> n){
int a[100]; int k,res;
for (int i = 0; i < n; i++){
cin >> k;
a[i] = k;
if (i == 1)res = lcm(a[0], a[1]);
else if (i>1)res = lcm(res, a[i]);
}
cout << res << endl;
}
return 0;
}