P3811 【模板】乘法逆元

传送门

模板:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 10000005;
const int inf = 0x3f3f3f3f;
int n, p;
ll inv[maxn];
int main() {
    //freopen("test.txt", "r", stdin);
    scanf("%d%d", &n, &p);
    inv[1] = 1;
    puts("1");
    for (int i = 2; i <= n; i++) {
        inv[i] = p - p / i * inv[p % i] % p;
        printf("%d\n", inv[i]);
    }
    return 0;
}