Submission #1688258

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const ld PI=abs(acos(-1));
int n;

ll gcd(ll a, ll b){
	if(b) return gcd(b,a%b);
	else return a;
}

ll lcm(ll a, ll b){
	return (a/gcd(a,b))*b;
}

int main(){
	cin >> n;
	
	ll pos=1,t;
	REP(i,0,n){
		cin >> t;
		pos=lcm(pos,t);
	}
	
	cout << pos << endl;
	return 0;
}

Submission Info

Judge Result