QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #634263 | #7735. Primitive Root | Yurily# | WA | 37ms | 3632kb | C++20 | 844b | 2024-10-12 16:58:32 | 2024-10-12 16:58:33 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
long long p,m;
long long calc(long long st,long long ed){
if(ed<st)
return 0;
long long l;
if(st-2<0)
l=0;
else
l=(st-2)/p+1;
long long r=(ed-1)/p+1;
return r-l;
}
void solve(){
cin>>p>>m;
if(m==0){
if(p==2){
cout<<1<<endl;
}
else
cout<<0<<endl;
return;
}
long long ans=0,st=0,ed;
for(int i=62;i>=0;--i){
if((1ll<<i)&m){
if((1ll<<i)&p){
st+=(1ll<<i);
}
ed=(__int128)st+(1ll<<i)-1;//cout<<st<<" "<<ed<<endl;
ans+=calc(st,ed);
if((1ll<<i)&p){
st-=(1ll<<i);
}
else
st+=(1ll<<i);
// cout<<ans<<endl;
}
else{
if((1ll<<i)&p){
st+=((1ll)<<i);
}
}
}
if((m^(p-1))%p==1)
ans++;
cout<<ans<<endl;
}
int main(){
int T;
cin>>T;
while(T--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
3 2 0 7 11 1145141 998244353
output:
1 2 872
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 37ms
memory: 3632kb
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 0 2 2 3 2 4 3 5 4 6 5 7 6 8 7 9 8 10 9 11 10 12 11 13 12 14 13 15 14 16 15 17 16 18 17 19 18 20 19 21 20 22 21 23 22 24 23 25 24 26 25 27 26 28 27 29 28 30 29 31 30 32 31 33 32 34 33 35 34 36 35 37 36 38 37 39 38 40 39 41 40 42 41 43 42 44 43 45 44 46 45 47 46 48 47 49 48 50 49 51 50 52 51 53 52 5...
result:
wrong answer 2nd lines differ - expected: '1', found: '0'