QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #241461 | #5. 在线 O(1) 逆元 | mfeitveer | 80 | 5546ms | 238284kb | C++14 | 386b | 2023-11-06 08:02:25 | 2024-11-05 21:54:28 |
Judging History
answer
#include "inv.h"
const int N = 30000010;
const int mod = 998244353;
typedef long long ll;
ll Inv[N];
ll ask(ll x)
{
if(x <= 30000000) return Inv[x];
return (mod - mod / x) * ask(mod % x) % mod;
}
void init(int p)
{
Inv[1] = 1;
for(int i = 2;i <= 30000000;i++)
Inv[i] = (mod - mod / i) * Inv[mod % i] % mod;
}
int inv(int x)
{
return ask(x);
}
详细
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 353ms
memory: 238136kb
Test #2:
score: 20
Accepted
time: 981ms
memory: 238284kb
Test #3:
score: 30
Accepted
time: 3579ms
memory: 238280kb
Test #4:
score: 20
Accepted
time: 5546ms
memory: 238276kb
Test #5:
score: 0
Time Limit Exceeded