QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#671945#7735. Primitive Rootwangxiaorui#WA 28ms3688kbC++141.1kb2024-10-24 15:05:342024-10-24 15:05:34

Judging History

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

  • [2024-10-24 15:05:34]
  • 评测
  • 测评结果:WA
  • 用时:28ms
  • 内存:3688kb
  • [2024-10-24 15:05:34]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll p,m;
ll ans;
int n,k;
int idxp[105],idxm[105];
ll pw[105];
void solve(){
    cin>>p>>m;
    ll t=p-1;
    n=0;ans=0;
    while(t){
        idxp[++n]=t%2;
        t/=2;
    }
    k=0;
    while(m){
        idxm[++k]=m%2;
        m/=2;
    }
    ll sum=0;
    for(int i=max(n,k);i>=1;i--){
        if(i>k){
            sum=sum*2+idxp[i];
        }
        else{
            if(idxm[i]==0){
                if(idxp[i]==1) sum=sum*2+1;
                else sum=sum*2;
            }
            else{
                ll l=(sum*2+idxp[i])*pw[i-1],r=(sum*2+idxp[i])*pw[i-1]+pw[i-1]-1;
                l--;r--;
                ans+=r/p-ceil((double)l/(double)p)+1;
                if(idxp[i]==0) sum=sum*2+1;
                else sum=sum*2;
            }
        }
    }
    if((m-1)%p==0) ans++;
    if((1LL^(p-1))<=m) ans++; 
    cout<<ans<<endl;
}
int main(){
    int T;
    pw[0]=1;
    for(int i=1;i<=69;i++) pw[i]=pw[i-1]*2;
    cin>>T;
    while(T--)
        solve();
    return 0;
}

详细

Test #1:

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

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: 3608kb

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
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
54...

result:

wrong answer 2nd lines differ - expected: '1', found: '2'