QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #489112 | #5. 在线 O(1) 逆元 | qwef_ | 60 | 4605ms | 394524kb | C++14 | 267b | 2024-07-24 18:07:43 | 2024-11-05 22:01:55 |
Judging History
answer
#include "inv.h"
typedef long long ll;
const int N=1e8+114,p=998244353;
int a[N];
void init(int _){
a[1]=1;
for(int i=2;i<N;++i) a[i]=(ll)(p-p/i)*a[p%i]%p;
}
int inv(int x){
for(int i=1,j=x;;++i,j=(j+x>=p?j+x-p:j+x))
if(j<N)
return (ll)a[j]*i%p;
}
Details
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 837ms
memory: 394500kb
Test #2:
score: 20
Accepted
time: 1621ms
memory: 394524kb
Test #3:
score: 30
Accepted
time: 4605ms
memory: 394412kb
Test #4:
score: 0
Time Limit Exceeded
Test #5:
score: 0
Time Limit Exceeded