QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#106132 | #5. 在线 O(1) 逆元 | zhoukangyang | Compile Error | / | / | C++17 | 971b | 2023-05-16 18:10:04 | 2023-05-16 18:10:05 |
Judging History
你现在查看的是测评时间为 2023-05-16 18:10:05 的历史记录
- [2024-11-05 21:49:31]
- 管理员手动重测本题所有提交记录
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-05-16 18:10:05]
- 评测
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2023-05-16 18:10:04]
- 提交
answer
#include<bits/stdc++.h>
#include "inv.h"
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector < int >
#define sz(a) ((int) (a).size())
#define ll long long
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a))
#define eb emplace_back
using namespace std;
const int B = 1e3, buf = 3, mod = 998244353, N = 6e6 + 7;
int K, use[N], iv[N];
inline int Inv(int x) {
return x < N ? iv[x] : (ll) Inv(mod % x) * (mod - mod / x) % mod;
}
inline int inv(int w) {
int d = w / B;
return use[d] ? Inv(w) : (ll) iv[(ll) w * use[d] % mod] * use[d] % mod;
}
void init(int rp) {
K = mod / B;
L(fb, 1, B * buf) {
int cur = 0;
for(int p = 0; p <= K; ++p) {
if(cur <= K * buf) {
use[p] = fb;
}
cur += fb * B;
if(cur >= mod) cur -= mod;
}
}
iv[1] = 1;
L(i, 2, N - 1) iv[i] = (ll) iv[mod % i] * (mod - mod / i) % mod;
}
Details
implementer.cpp: In function ‘int main()’: implementer.cpp:22:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 22 | scanf("%d", &n); | ~~~~~^~~~~~~~~~ /usr/bin/ld: /tmp/cc2PaGo6.o: in function `main': implementer.cpp:(.text.startup+0x1f8): undefined reference to `inv(int)' collect2: error: ld returned 1 exit status