QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#720800#7735. Primitive RootguangxuautumnWA 28ms3620kbC++14927b2024-11-07 14:10:362024-11-07 14:10:37

Judging History

你现在查看的是最新测评结果

  • [2024-11-07 14:10:37]
  • 评测
  • 测评结果:WA
  • 用时:28ms
  • 内存:3620kb
  • [2024-11-07 14:10:36]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void solve()
{
	ll p, m;
	cin >> p >> m;

	if(m == 0) {
		if(p == 2) cout << 1 << endl;
		else cout << 0 << endl;

		return;
	}
	if(p == 2) {
		cout << m / 2 + 1 << endl;
		return;
	}

	//for(int i = 1; i < 1000; i ++) {
	//	if(((p * i + 1) % p) ^ (p - 1) > (p * i + 1) % p) {
	//		cout << 1;
	//	}else cout << 0;
	//}
	ll ans = 1;
	ll maxk = (m - 1) / p;
	//cout << "maxk" << maxk << endl;
	if(((p * maxk + 1) ^ (p - 1)) > m) {
		//cout << p * maxk + 1 << endl;
		//cout << maxk << ' ' << ((p * maxk + 1) ^ (p - 1)) << endl;
		ans --;
	}  
	if(((p * (maxk + 1) + 1) ^ (p - 1)) < m) {
		ans ++;
	}
	//for(ll i = maxk + 1; ; i ++) {
	//	if(((p * i + 1)) ^ (p - 1) > m) break;
	//	else ans ++;
	//}

	cout << maxk + ans << endl;

}

int main()
{
	int t;
	cin >> t;

	while(t--)
		solve();

	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3620kb

input:

3
2 0
7 11
1145141 998244353

output:

1
2
872

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 28ms
memory: 3620kb

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 507th lines differ - expected: '2', found: '1'