【Codeforces 1349A】Orac and LCM

Joanh_Lan

于 2022-10-06 00:05:58 发布

阅读量165

点赞数

分类专栏：练习文章标签： c++ 算法数论

本文链接：https://blog.csdn.net/m0_60593173/article/details/127178669

版权

练习专栏收录该内容

42 篇文章 0 订阅

订阅专栏

思路

gcd1=gcd[lcm(a1,a2),lcm(a1,a3)…lcm(a1,an)]=gcd(a1,lcm(a2,a3…an))
gcd2=gcd[lcm(a2,a3),lcm(a2,a4)…lcm(a2,an)]=gcd(a2,lcm(a3,a4…an))
…
gcdk=gcd[lcm(ak,ak + 1),lcm(ak,ak + 2)…lcm(ak,an)]=gcd(ak,lcm(ak,ak + 1…an))

可推出

res=gcd(gcd1,gcd2,…,gcdn)

AC代码：

#include <bits/stdc++.h>
#define buff                     \
    ios::sync_with_stdio(false); \
    cin.tie(0);
#define PII pair<int, int>
#define int long long
//#define ll long long
using namespace std;
const int N = 1e5 + 9;
int s[N];
int n;
int gcd[N];
int lcm(int a, int b)
{
    return a * b / __gcd(a, b);
}
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> s[i];
    for (int i = n; i >= 1; i--)
        gcd[i] = __gcd(s[i], gcd[i + 1]);
    int ans = 0;
    for (int i = 1; i <= n; i++)
        ans = __gcd(ans, lcm(s[i], gcd[i + 1]));

    cout << ans << '\n';
}
signed main()
{
    buff;
    solve();
}