QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #4913 | #5. 在线 O(1) 逆元 | Qingyu | 60 | 5906ms | 3880kb | C++11 | 281b | 2020-10-15 22:49:10 | 2024-11-05 21:44:49 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2020-10-15 22:49:10]
- 提交
answer
#include "inv.h"
typedef long long ll;
const int mod = 998244353;
inline ll pw(ll x, ll p = mod - 2)
{
ll r = 1;
while (p)
{
if (p & 1) r = r * x % mod;
x = x * x % mod;
p >>= 1;
}
return r;
}
void init(int p) {}
int inv(int x) { return pw(x); }
Details
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 9ms
memory: 3688kb
Test #2:
score: 20
Accepted
time: 1187ms
memory: 3880kb
Test #3:
score: 30
Accepted
time: 5906ms
memory: 3696kb
Test #4:
score: 0
Time Limit Exceeded
Test #5:
score: 0
Time Limit Exceeded