QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #640907 | #5. 在线 O(1) 逆元 | masterhuang | 100 ✓ | 4706ms | 19080kb | C++20 | 348b | 2024-10-14 16:50:40 | 2024-10-14 16:50:41 |
Judging History
answer
#include "inv.h"
#include<bits/stdc++.h>
using namespace std;
const int mod=998244353,N=mod>>8;
int n=N-1,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];int q=mod/x,r=mod%x;
if(r<x/2) return mod-1ll*q*inv(r)%mod;
return 1ll*(q+1)*inv(x-r)%mod;
}
Details
Pretests
Final Tests
Test #1:
score: 30
Accepted
time: 23ms
memory: 19076kb
Test #2:
score: 40
Accepted
time: 472ms
memory: 18908kb
Test #3:
score: 30
Accepted
time: 4706ms
memory: 19080kb