QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #128665 | #5. 在线 O(1) 逆元 | Leasier | 60 | 4086ms | 81960kb | C++11 | 358b | 2023-07-21 14:40:20 | 2024-11-05 21:50:58 |
Judging History
answer
#include "inv.h"
const int N = 2e7;
int mod;
int inv_list[N + 7];
void init(int p){
mod = p;
inv_list[0] = inv_list[1] = 1;
for (register int i = 2; i <= N; i++){
inv_list[i] = mod - 1ll * (mod / i) * inv_list[mod % i] % mod;
}
}
int inv(int x){
if (x <= N) return inv_list[x];
return mod - 1ll * (mod / x) * inv(mod % x) % mod;
}
詳細信息
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 300ms
memory: 81912kb
Test #2:
score: 20
Accepted
time: 1045ms
memory: 81960kb
Test #3:
score: 30
Accepted
time: 4086ms
memory: 81876kb
Test #4:
score: 0
Time Limit Exceeded
Test #5:
score: 0
Time Limit Exceeded