QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #624884 | #5. 在线 O(1) 逆元 | BlackPanda | 100 ✓ | 5831ms | 394508kb | C++14 | 327b | 2024-10-09 16:49:06 | 2024-11-05 22:05:07 |
Judging History
answer
#include "inv.h"
const int MAXN = 1e8 + 5;
const int MOD = 998244353;
int invt[MAXN];
void init(int p)
{
invt[1] = 1;
for(int i = 2 ; i <= MAXN ; i++) invt[i] = p - 1ll * (p / i) * invt[p % i] % p;
}
int inv(int x)
{
if(x < MAXN) return invt[x];
else return MOD - 1ll * (MOD / x) * inv(MOD % x) % MOD;
}
详细
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 765ms
memory: 394508kb
Test #2:
score: 20
Accepted
time: 1315ms
memory: 394484kb
Test #3:
score: 30
Accepted
time: 3305ms
memory: 394316kb
Test #4:
score: 20
Accepted
time: 4765ms
memory: 394412kb
Test #5:
score: 20
Accepted
time: 5831ms
memory: 394356kb