QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #102579 | #5. 在线 O(1) 逆元 | liuzhenhao09 | 0 | 0ms | 0kb | C++20 | 269b | 2023-05-03 14:49:30 | 2024-11-05 21:49:19 |
Judging History
answer
#include<bits/stdc++.h>
#include "inv.h"
using namespace std;
const int MOD = 998244353;
int iv[10000010];
void init(int p){
iv[1] = 1;
for(int i = 2; i <= 10000000; i++) iv[i] = 1LL * (MOD - MOD / i) * iv[MOD % i] % MOD;
}
int inv(int x){
return iv[x];
}
Details
Pretests
Final Tests
Test #1:
score: 0
Runtime Error
Test #2:
score: 0
Runtime Error
Test #3:
score: 0
Runtime Error
Test #4:
score: 0
Runtime Error
Test #5:
score: 0
Runtime Error