QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #624838 | #5. 在线 O(1) 逆元 | BlackPanda | 0 | 0ms | 0kb | C++14 | 230b | 2024-10-09 16:42:21 | 2024-11-05 22:04:46 |
Judging History
answer
#include "inv.h"
const int N = 998244354;
int invv[N];
void init(int p)
{
invv[1] = 1;
for (int i = 2; i <= N; i ++ )
{
invv[i] = (p - p / i) * invv[p % i] % p;
}
}
int inv(int x)
{
return invv[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
Memory Limit Exceeded