QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #241463 | #5. 在线 O(1) 逆元 | mfeitveer | 0 | 0ms | 0kb | C++14 | 375b | 2023-11-06 08:04:03 | 2024-11-05 21:54:44 |
Judging History
answer
#include "inv.h"
const int N = 100000010;
const int mod = 998244353;
typedef long long ll;
ll Inv[N];
ll ask(ll x) {
return (x <= 100000000 ? Inv[x] : (mod - mod / x) * ask(mod % x) % mod);
}
void init(int p) {
Inv[1] = 1;
for(int i = 2;i <= 100000000;i++)
Inv[i] = (mod - mod / i) * Inv[mod % i] % mod;
}
int inv(int x) {
return ask(x);
}
详细
Pretests
Final Tests
Test #1:
score: 0
Memory Limit Exceeded
Test #2:
score: 0
Memory Limit Exceeded
Test #3:
score: 0
Memory Limit Exceeded
Test #4:
score: 0
Memory Limit Exceeded
Test #5:
score: 0
Time Limit Exceeded