90分玄关
查看原帖
90分玄关
1351893
MuYuMC楼主2024/9/11 12:28
#include <iostream>
#include <cstring> 
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <iomanip>
#include <map>
#include <queue>
#include <set> 
#define ll long long
using namespace std;
ll A[1000000];
int gcd(int x,int y)
{
	int i,j;
	int sum;
	sum = max(x,y);
	for(i = sum / 2;i >= 1;i--)
	{
		if(x % i == 0 && y % i == 0)
		{  
			return i;
		}
	}
	return 1;
}
int main()
{
	int n,i,j;
	int a,sum = 1;
	cin >> n;
	for(i = 1;i <= n;i++)
	{
		cin >> a;
		sum *= a / gcd(sum,a);
//		cout << sum << endl;
	}
	cout << sum;
    return 0;
}
2024/9/11 12:28
加载中...