QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #468537 | #5. 在线 O(1) 逆元 | yzc358230151 | 70 | 1413ms | 3848kb | C++14 | 241b | 2024-07-08 21:24:28 | 2024-07-08 21:24:28 |
Judging History
answer
#include"inv.h"
typedef long long ll;
#define MOD 998244353
int Inv[MOD];
void init(int p){
Inv[1]=1;
}
int inv(int x){
if(!x)
return 0;
else if(Inv[x])
return Inv[x];
else
return (ll)(MOD-MOD/x)%MOD*inv(MOD%x)%MOD;
}
Details
Test #1:
score: 30
Accepted
time: 15ms
memory: 3784kb
Test #2:
score: 40
Accepted
time: 1413ms
memory: 3848kb
Test #3:
score: 0
Time Limit Exceeded