90分求解

#include<bits/stdc++.h>
#include<cstdio>
using namespace std;
int GCD(int a,int b)
{
	int r;
	while(a%b!=0)
	{
		r=a%b,a=b,b=r;
	}
	return b;
}
int LCM(int n,int m)
{
	return n*m/GCD(n,m);
}
int main()
{
	int n,i,num,lcm=1;
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>num;
		lcm=LCM(lcm,num);
	}
	cout<<lcm;
   return 0;
}