QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#657997#7735. Primitive RootmiluosiWA 11ms3676kbC++14697b2024-10-19 15:57:002024-10-19 15:57:07

Judging History

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

  • [2024-10-19 15:57:07]
  • 评测
  • 测评结果：WA
  • 用时：11ms
  • 内存：3676kb
查看
  • [2024-10-19 15:57:00]
  • 提交

answer

#include<iostream>
#include<unordered_map>
#include<vector>
#include<algorithm>
#include<string>
#include<math.h>
#include<map>
#include<set>
#include<string.h>
#include<iomanip>
#include<queue>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
//int mod = 998244353;

ull log(ull p, ull m) {
	ull ans = 0;
	while (m) {
		m /= p;
		ans++;
	}
	return ans;
}

int main()
{
	int t;
	cin >> t;
	while (t--)
	{
		ull p, m;
		cin >> p >> m;
		ull k = 0,ans=0;
		for (k = 0;k<=log(p,m)+min(p,min(m,m/p)); k++)
		{
			if (((k * p + 1) ^ (p - 1)) <= m)
			{
				ans++;
			}
		}
		cout << ans << endl;
	}
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3644kb

input:

3
2 0
7 11
1145141 998244353

output:

1
2
872

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 11ms
memory: 3676kb

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
7
7
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
8
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
9
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
10
1...

result:

wrong answer 15th lines differ - expected: '8', found: '7'
English 繁體中文 简体中文

Server Time: 2024-12-05 12:43:24 | OpenSource Project