QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #188481 | #5. 在线 O(1) 逆元 | EnofTaiPeople | 100 ✓ | 5454ms | 394516kb | C++14 | 403b | 2023-09-25 21:20:51 | 2024-11-05 21:52:24 |
Judging History
answer
#include<bits/stdc++.h>
#include "inv.h"
using namespace std;
using ll=long long;
const int N=1e8+8,M=998244353;
int nv[N];
void init(int p){
int x;
nv[0]=nv[1]=1;
for(x=2;x<N;++x)
nv[x]=ll(M-M/x)*nv[M%x]%M;
}
int sol(int d){
if(d<N)return nv[d];
if(d<M-d){
return ll(M-M/d)*sol(M%d)%M;
}else{
d=M-d;
return ll(M/d)*sol(M%d)%M;
}
}
int inv(int x){
return sol(x);
}
Details
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 766ms
memory: 394460kb
Test #2:
score: 20
Accepted
time: 1189ms
memory: 394328kb
Test #3:
score: 30
Accepted
time: 3091ms
memory: 394516kb
Test #4:
score: 20
Accepted
time: 4526ms
memory: 394364kb
Test #5:
score: 20
Accepted
time: 5454ms
memory: 394508kb