QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #624884 | #5. 在线 O(1) 逆元 | BlackPanda | 100 ✓ | 5377ms | 394456kb | C++14 | 327b | 2024-10-09 16:49:06 | 2024-10-09 16:49:06 |
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;
}
Details
Pretests
Final Tests
Test #1:
score: 30
Accepted
time: 707ms
memory: 394400kb
Test #2:
score: 40
Accepted
time: 1194ms
memory: 394320kb
Test #3:
score: 30
Accepted
time: 5377ms
memory: 394456kb