QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #4936 | #5. 在线 O(1) 逆元 | zombie462 | 60 | 4217ms | 42956kb | C++11 | 308b | 2020-10-19 09:42:23 | 2024-11-05 21:45:30 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2020-10-19 09:42:23]
- 提交
answer
#include <bits/stdc++.h>
#include "inv.h"
using namespace std;
const int mod=998244353;
const int N=10000010;
int invv[N];
int inv(int a){
return a<N?invv[a]:1LL*(mod-mod/a)*inv(mod%a)%mod;
}
void init(int p){
invv[0]=invv[1]=1;
for (int i=2;i<N;++i) invv[i]=1LL*(mod-mod/i)*invv[mod%i]%mod;
}
Details
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 119ms
memory: 42892kb
Test #2:
score: 20
Accepted
time: 920ms
memory: 42812kb
Test #3:
score: 30
Accepted
time: 4217ms
memory: 42956kb
Test #4:
score: 0
Time Limit Exceeded
Test #5:
score: 0
Time Limit Exceeded