QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #99136 | #5. 在线 O(1) 逆元 | reechee | 0 | 767ms | 394484kb | C++14 | 210b | 2023-04-21 11:55:15 | 2024-11-05 21:48:01 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-04-21 11:55:15]
- 提交
answer
#define F(i,l,r) for (int i=l;i<=r;++i)
constexpr int N=1e8+5;
int Inv[N];
void init(int p){
Inv[1]=1;
F(i,2,N-1) Inv[i]=(p-p/i)*Inv[p%i]%p;
return ;
}
int inv(int x){
return Inv[x];
}
詳細信息
Pretests
Final Tests
Test #1:
score: 0
Runtime Error
Test #2:
score: 0
Runtime Error
Test #3:
score: 0
Wrong Answer
time: 767ms
memory: 394484kb
Test #4:
score: 0
Runtime Error
Test #5:
score: 0
Runtime Error