QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #822661 | #5. 在线 O(1) 逆元 | BehruzbekX | 60 | 5890ms | 3856kb | C++20 | 223b | 2024-12-20 15:19:32 | 2024-12-20 15:19:32 |
Judging History
answer
#define mod 998244353
using ll = long long;
void init(int p) {
}
ll bpow (ll a, ll b) {
ll r = 1;
for(;b;b>>=1, a = (a*a)%mod)if(b&1)r=(r*a)%mod;
return r;
}
ll inv(int n){ll nn = n;return bpow(nn, mod - 2);}
詳細信息
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 12ms
memory: 3628kb
Test #2:
score: 20
Accepted
time: 1178ms
memory: 3624kb
Test #3:
score: 30
Accepted
time: 5890ms
memory: 3856kb
Test #4:
score: 0
Time Limit Exceeded
Test #5:
score: 0
Time Limit Exceeded