QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#694081 | #7735. Primitive Root | HeJuMuFan# | WA | 20ms | 3660kb | C++20 | 1015b | 2024-10-31 17:14:14 | 2024-10-31 17:14:20 |
Judging History
answer
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cout << #x << " " << x << endl;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
// 求二进制输出
void two_print(int x)
{
for (int i = 62; i >= 0; i--) {
int bit = x >> i & 1;
cout << bit;
}
cout << endl;
}
// 判断函数
bool check(int g,int P)
{
if (((g ^ (P - 1)) % P) == 1ll) {
return true;
}
return false;
}
void solve()
{
int P, m;
cin >> P >> m;
//two_print(P);
//// 打表,枚举m
//int cnt = 0;
//for (int i = 0; i <= m; i++) {
// if (check(i, P)) {
// cnt++;
// int xxor = i ^ (P - 1);
// //debug(i);
// //two_print(i);
// //debug(xxor);
// }
//}
//debug(cnt);
//for (int i = 0; i <= 10; i++) {
// int x = i * P + 1;
// debug(x);
// two_print(x);
//}
cout << m / P + 1 << endl;
}
signed main()
{
IOS;
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
input:
3 2 0 7 11 1145141 998244353
output:
1 2 872
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 20ms
memory: 3660kb
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 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 11 11 12 12 13 13 14 14 15 15 16 16 17 17 18 18 19 19 20 20 21 21 22 22 23 23 24 24 25 25 26 26 27 27 28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 41 41 42 42 43 43 44 44 45 45 46 46 47 47 48 48 49 49 50 50 51 51 52 52 53 53 ...
result:
wrong answer 502nd lines differ - expected: '0', found: '1'