QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #102567 | #5. 在线 O(1) 逆元 | liuzhenhao09 | 0 | 0ms | 0kb | C++14 | 216b | 2023-05-03 14:43:45 | 2024-11-05 21:49:18 |
Judging History
This is the latest submission verdict.
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-05-03 14:43:45]
- Submitted
answer
#include<bits/stdc++.h>
#include "inv.h"
int iv[10000010];
void init(int p){
iv[1] = 1;
for(int i = 2; i <= 10000000; i++) iv[i] = (long long)(p - p / i) * iv[p % i] % p;
}
int inv(int x){
return iv[x];
}
詳細信息
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