QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #624879 | #5. 在线 O(1) 逆元 | dww_1337 | 100 ✓ | 5615ms | 394540kb | C++14 | 327b | 2024-10-09 16:48:30 | 2024-11-05 22:04:59 |
Judging History
answer
#include "inv.h"
const int P = 998244353;
const int N = 1e8 + 5;
int invv[N];
void init(int p)
{
invv[1] = 1;
for (int i = 2; i <= N; i ++ )
{
invv[i] = p - 1ll*(p / i) * invv[p % i] % p;
}
}
int inv(int x)
{
if(x < N){
return invv[x];
} else {
return P-1ll*(P / x) * inv(P % x) % P;
}
}
Details
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 820ms
memory: 394340kb
Test #2:
score: 20
Accepted
time: 1328ms
memory: 394540kb
Test #3:
score: 30
Accepted
time: 3333ms
memory: 394388kb
Test #4:
score: 20
Accepted
time: 4658ms
memory: 394340kb
Test #5:
score: 20
Accepted
time: 5615ms
memory: 394340kb