QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #468527 | #5. 在线 O(1) 逆元 | yzc358230151 | 10 | 290ms | 42384kb | C++14 | 302b | 2024-07-08 21:21:18 | 2024-11-05 22:00:02 |
Judging History
answer
#include"inv.h"
#include<unordered_map>
using std::unordered_map;
typedef long long ll;
int MOD;
unordered_map<int,int>Inv;
void init(int p){
MOD=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
Pretests
Final Tests
Test #1:
score: 10
Accepted
time: 290ms
memory: 42384kb
Test #2:
score: 0
Time Limit Exceeded
Test #3:
score: 0
Time Limit Exceeded
Test #4:
score: 0
Time Limit Exceeded
Test #5:
score: 0
Time Limit Exceeded