Gym - 102861N - Number Multiplication (分解质因数、Miller_Rabin、Pollard_Rho)

最新推荐文章于 2022-02-19 10:06:00 发布

weifeng2356

最新推荐文章于 2022-02-19 10:06:00 发布

阅读量376

点赞数

分类专栏：题解数论算法

本文链接：https://blog.csdn.net/qq_45799024/article/details/117233574

版权

题解同时被 3 个专栏收录

22 篇文章 1 订阅

订阅专栏

算法

15 篇文章 0 订阅

订阅专栏

数论

6 篇文章 0 订阅

订阅专栏

2020-2021 ACM-ICPC Brazil Subregional Programming Contest
Codeforces - Gym102861 N. Number Multiplication

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int M, N, K;
int m, n, d;
ll c;
set<ll> ans;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll mul(ll a, ll b, ll p) {
    ll res = 0;
    a %= p;
    while (b) {
        if (b & 1) {
            res = (res + a) % p;
        }
        a = (a + a) % p;
        b >>= 1;
    }
    return res;
}
ll pow(ll a, ll b, ll p) {
    ll res = 1;
    a %= p;
    while (b) {
        if (b & 1) {
            res = mul(res, a, p);
        }
        a = mul(a, a, p);
        b >>= 1;
    }
    return res;
}
bool Miller_Rabin(ll n) {
    if (n <= 2) return n == 2;
    if ((n & 1) == 0) return false;
    ll m = n - 1;
    int k = 0;
    while ((m & 1) == 0) {
        m >>= 1;
        ++k;
    }
    ll A[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
    for (auto a : A) {
        ll x = pow(a, m, n);
        if(x <= 1 || x >= n - 1) continue;
        for (int i = 0; i < k; ++i) {
            x = mul(x, x, n);
            if (x == n - 1 && i != k - 1) {
                x = 1;
                break;
            }
            if(x == 1) return false;
        }
        if (x != 1) return false;
    }
    return true;
}
ll Pollard_Rho(ll n) {
    ll s = 0, t = 0;
    ll c = 1ll * rand() % (n - 1) + 1;
    int step = 0, goal = 1;
    ll val = 1;
    for (goal = 1;; goal <<= 1, s = t, val = 1) {
        for (step = 1; step <= goal; ++step) {
            t = (mul(t, t, n) + c) % n;
            val = mul(val, abs(t - s), n);
            if ((step % 127) == 0) {
                ll d = gcd(val, n);
                if (d > 1) return d;
            }
        }
        ll d = gcd(val, n);
        if (d > 1) return d;
    }
}
void find(ll n) {
    if (Miller_Rabin(n)) {
        ans.insert(n);
        return;
    }
    ll p = n;
    while (p >= n) {
        p = Pollard_Rho(p);
    }
    find(n / p);
    find(p);
}
int main() {
    scanf("%d%d%d", &M, &N, &K);
    for (int i = 1; i <= N; ++i) {
        scanf("%lld", &c);
        find(c);
    }
    for (int i = 1; i <= K; ++i) {
        scanf("%d%d%d", &m, &n, &d);
    }
    for (auto iter : ans) {
        printf("%lld ", iter);
    }
    printf("\n");
    return 0;
}