QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#673853 | #7735. Primitive Root | nageing | WA | 8ms | 3624kb | C++20 | 736b | 2024-10-25 11:04:08 | 2024-10-25 11:04:14 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
void solve() {
ll p, m;
cin >> p >> m;
ll now = 0;
auto cal = [&](int x) -> ll {
// L <= kp < R
ll L = now - 1, R = now + (1 << x) - 1;
ll sum2 = (R + p - 1) / p, sum1 = (L + p - 1) / p;
return (sum2 - sum1 < 0 ? 0 : sum2 - sum1);
};
ll ans = 0;
for (int i = 63; i >= 0; i --) {
if ((m >> i) & 1) {
ans = ans + cal(i);
now = now + (1 << i);
}
}
if ((m & 1) == 0) {
ans = ans + (((m ^ p - 1) - 1) % p == 0);
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
cin >> t;
while (t --) {
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3624kb
input:
3 2 0 7 11 1145141 998244353
output:
1 2 872
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 8ms
memory: 3572kb
input:
47595 2 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 2 13 2 14 2 15 2 16 2 17 2 18 2 19 2 20 2 21 2 22 2 23 2 24 2 25 2 26 2 27 2 28 2 29 2 30 2 31 2 32 2 33 2 34 2 35 2 36 2 37 2 38 2 39 2 40 2 41 2 42 2 43 2 44 2 45 2 46 2 47 2 48 2 49 2 50 2 51 2 52 2 53 2 54 2 55 2 56 2 57 2 58 2 59 2 60...
output:
1 0 2 1 3 2 4 3 5 4 6 5 7 6 8 7 9 8 10 9 11 10 12 11 13 12 14 13 15 14 16 15 17 16 18 17 19 18 20 19 21 20 22 21 23 22 24 23 25 24 26 25 27 26 28 27 29 28 30 29 31 30 32 31 33 32 34 33 35 34 36 35 37 36 38 37 39 38 40 39 41 40 42 41 43 42 44 43 45 44 46 45 47 46 48 47 49 48 50 49 51 50 52 51 53 52 5...
result:
wrong answer 2nd lines differ - expected: '1', found: '0'