QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #293461 | #5. 在线 O(1) 逆元 | iee | 70 ✓ | 1255ms | 394184kb | C++14 | 392b | 2023-12-29 10:32:21 | 2023-12-29 10:32:22 |
Judging History
answer
#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "inv.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: 656ms
memory: 394184kb
Test #2:
score: 40
Accepted
time: 1255ms
memory: 394128kb
Test #3:
score: 0
Time Limit Exceeded