QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #293466 | #5. 在线 O(1) 逆元 | iee | 0 | 683ms | 394456kb | C++11 | 435b | 2023-12-29 10:41:32 | 2023-12-29 10:41:33 |
Judging History
answer
#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include "inv.h"
using namespace std;
constexpr int N = 1e8;
int v[N], P;
void init(int p) {
P = p;
v[1] = 1;
for (int i = 2; i < N; i++) {
v[i] = P - 1ll * v[P % i] * (P / i) % P;
}
}
int inv(int x) {
int res = 1;
while (x >= N) {
res = P - 1ll * res * (P / x);
x = P % x;
}
return 1ll * res * v[x] % P;
}
详细
Test #1:
score: 0
Wrong Answer
time: 678ms
memory: 394412kb
Test #2:
score: 0
Wrong Answer
time: 683ms
memory: 394112kb
Test #3:
score: 0
Wrong Answer
time: 677ms
memory: 394456kb