QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#694416#7735. Primitive RootRosmontis_L#TL 2ms3640kbC++20516b2024-10-31 17:54:252024-10-31 17:54:44

Judging History

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

  • [2024-10-31 17:54:44]
  • 评测
  • 测评结果:TL
  • 用时:2ms
  • 内存:3640kb
  • [2024-10-31 17:54:25]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;

void solve(){
    ll p, m;
    cin >> p >> m;
    ll res = m / p;
    for(ll k = m / p ; k < m / p + 1000000; k ++) {
        ll t = k * p + 1;
        if((t ^ (p - 1)) <= m) {
            res ++;
        }
    }
    cout << res << '\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1;
    cin >> t;
    while(t --){
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3640kb

input:

3
2 0
7 11
1145141 998244353

output:

1
2
872

result:

ok 3 lines

Test #2:

score: -100
Time Limit Exceeded

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:


result: