QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #668164 | #7735. Primitive Root | D06 | WA | 8ms | 3708kb | C++14 | 626b | 2024-10-23 12:03:22 | 2024-10-23 12:03:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
long long p,m,ans;
long long lowbit(long long n)
{
return n&(-n);
}
long long calc(long long m)
{
if(m==0)
{
return 0;
}
return (m-1)/p+1;
}
long long calc(long long l,long long r)
{
long long tmp=lowbit(r)-1;
tmp=~tmp;
long long f=(p-1)&tmp;
l=l^f;
return calc(l+lowbit(r)-1)-calc(l)+((r^(p-1))%p==1);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin>>T;
while(T--)
{
cin>>p>>m;
ans=((p-1)%p==1);
while(m)
{
ans+=calc(m-lowbit(m),m);
m-=lowbit(m);
}
cout<<ans<<endl;
}
return 0;
}
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: 8ms
memory: 3708kb
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 3 3 4 4 6 6 6 6 8 8 9 9 11 11 10 10 12 12 13 13 15 15 15 15 17 17 18 18 20 20 18 18 20 20 21 21 23 23 23 23 25 25 26 26 28 28 27 27 29 29 30 30 32 32 32 32 34 34 35 35 37 37 34 34 36 36 37 37 39 39 39 39 41 41 42 42 44 44 43 43 45 45 46 46 48 48 48 48 50 50 51 51 53 53 51 51 53 53 54 54 56 56 56...
result:
wrong answer 3rd lines differ - expected: '2', found: '3'