QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #640856 | #5. 在线 O(1) 逆元 | masterhuang | 0 | 57ms | 42952kb | C++14 | 348b | 2024-10-14 16:31:47 | 2024-11-05 22:05:41 |
Judging History
answer
#include "inv.h"
#include<bits/stdc++.h>
using namespace std;
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*inv(x-r)%mod;
}
Details
Pretests
Final Tests
Test #1:
score: 0
Wrong Answer
time: 54ms
memory: 42952kb
Test #2:
score: 0
Wrong Answer
time: 57ms
memory: 42948kb
Test #3:
score: 0
Wrong Answer
time: 47ms
memory: 42944kb
Test #4:
score: 0
Wrong Answer
time: 49ms
memory: 42756kb
Test #5:
score: 0
Wrong Answer
time: 48ms
memory: 42840kb