0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-25 06:51:58 +00:00

P3811 【模板】乘法逆元

R41337330
This commit is contained in:
Baoshuo Ren 2020-11-05 20:57:12 +08:00 committed by Baoshuo Ren
parent 279c817d86
commit 162d089d41
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

18
problem/P3811/P3811.cpp Normal file
View File

@ -0,0 +1,18 @@
#include <bits/stdc++.h>
using namespace std;
long long inv[3000005];
int main() {
inv[0] = 0;
inv[1] = 1;
int n, p;
scanf("%d%d", &n, &p);
printf("1\n");
for (int i = 2; i <= n; ++i) {
inv[i] = (long long)p - (p / i) * inv[p % i] % p;
printf("%d\n", inv[i]);
}
return 0;
}