QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #780394 | #5. 在线 O(1) 逆元 | GoatGirl98 | 100 ✓ | 4635ms | 42964kb | C++14 | 301b | 2024-11-25 10:39:44 | 2024-11-25 10:39:50 |
Judging History
answer
#include "inv.h"
const int N=1e7+5,mod=998244353;
int n=N-5, 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;
}
詳細信息
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 46ms
memory: 42768kb
Test #2:
score: 20
Accepted
time: 517ms
memory: 42964kb
Test #3:
score: 30
Accepted
time: 2358ms
memory: 42944kb
Test #4:
score: 20
Accepted
time: 3744ms
memory: 42948kb
Test #5:
score: 20
Accepted
time: 4635ms
memory: 42828kb