线性求逆元

真不想学了ⅴ

已于 2022-08-21 12:41:04 修改

阅读量84

点赞数

文章标签：乘法逆元快速幂取模运算 C++ 算法优化

于 2022-08-21 12:37:09 首次发布

本文链接：https://blog.csdn.net/who_care_you_/article/details/126449657

版权

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inv[4000010], n, p, mod;
void get_inv() {
    inv[1] = 1;
    cout << inv[1] << endl;

    for (int i = 2; i <= n; i++) {
        inv[i] = (mod - mod / i) * inv[mod % i] % mod;
        cout << inv[i] << endl;
    }
}
int main() {
    cin >> n >> p;
    mod = p;
    get_inv();
    return 0;
}

乘法逆元 - OI Wiki (oi-wiki.org)

// C++ Version
s[0] = 1;
for (int i = 1; i <= n; ++i) s[i] = s[i - 1] * a[i] % p;
sv[n] = qpow(s[n], p - 2);
// 当然这里也可以用 exgcd 来求逆元,视个人喜好而定.
for (int i = n; i >= 1; --i) sv[i - 1] = sv[i] * a[i] % p;
for (int i = 1; i <= n; ++i) inv[i] = sv[i] * s[i - 1] % p;