QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #714087 | #5. 在线 O(1) 逆元 | lgx57 | 100 ✓ | 5441ms | 19516kb | C++14 | 285b | 2024-11-05 21:37:36 | 2024-11-05 21:37:37 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
const int N=4000000;
int I[N];
void init(int p){
I[1]=1;
for (int i=2;i<N;i++) I[i]=mod-1ll*(mod/i)*I[mod%i]%mod;
}
int inv(int x){
if (x<N) return I[x];
else return mod-1ll*(mod/x)*inv(mod%x)%mod;
}
Details
Pretests
Final Tests
Test #1:
score: 30
Accepted
time: 25ms
memory: 19512kb
Test #2:
score: 40
Accepted
time: 553ms
memory: 19516kb
Test #3:
score: 30
Accepted
time: 5441ms
memory: 19368kb