QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #293458 | #5. 在线 O(1) 逆元 | iee | 70 ✓ | 1362ms | 394196kb | C++14 | 303b | 2023-12-29 10:29:44 | 2023-12-29 10:29:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
constexpr int P = 998244353, N = 1e8;
int v[N];
void init(int p) {
v[1] = 1;
for (int i = 2; i < N; i++) {
v[i] = P - 1ll * v[P % i] * (P / i) % P;
}
}
int inv(int x) {
if (x < N) return v[x];
return P - 1ll * inv(P % x) * (P / x) % P;
}
Details
Test #1:
score: 30
Accepted
time: 799ms
memory: 394184kb
Test #2:
score: 40
Accepted
time: 1362ms
memory: 394196kb
Test #3:
score: 0
Time Limit Exceeded