QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #136493 | #5. 在线 O(1) 逆元 | zhouhuanyi | 70 | 849ms | 42724kb | C++14 | 387b | 2023-08-08 21:04:54 | 2023-08-08 21:04:58 |
Judging History
answer
#include<iostream>
#include<cstdio>
#define mod 998244353
#define N 10000000
using namespace std;
int MD2(int x)
{
return x<0?x+mod:x;
}
int T,invs[N+1];
void init(int p)
{
invs[1]=1;
for (int i=2;i<=N;++i) invs[i]=MD2(-1ll*(mod/i)*invs[mod%i]%mod);
return;
}
int inv(int x)
{
int a,b;
if (x<=N) return invs[x];
else return MD2(-1ll*(mod/x)*inv(mod%x)%mod);
}
Details
Test #1:
score: 30
Accepted
time: 81ms
memory: 42660kb
Test #2:
score: 40
Accepted
time: 849ms
memory: 42724kb
Test #3:
score: 0
Time Limit Exceeded