QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#638838 | #7735. Primitive Root | Alasco | WA | 13ms | 3676kb | C++14 | 842b | 2024-10-13 17:02:26 | 2024-10-13 17:02:27 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;using ll=long long;using ld=long double;using ull=unsigned long long;
const ll M=998244353;const double eps=1e-10;const int inf=1e9+7;const ll INF=1e17;
ll m,p,np1,nm,k;
void __(){
cin>>p>>m;
np1=nm=-1;
for(int i=60;i>=0;i--){
if((1ll<<i)&(p-1)){
np1=i;break;
}
}
for(int i=60;i>=0;i--){
if((1ll<<i)&m){
nm=i;break;
}
}
ll tmp=(m|((1ll<<(np1+1))-1))-((1ll<<(np1+1))-1);
ll k=max(0ll,(tmp-2)/p);
int num=0;
for(ll i=k+1;i<=k+105;i++){
if(i*p+1>=(1ll<<61))break;
if(((i*p+1)^(p-1))<=m){
num++;
}
}
cout<<num+k+1ll<<"\n";
}
signed main(){
ios::sync_with_stdio(false),cin.tie(nullptr);
int _;cin>>_;while(_--)__();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3676kb
input:
3 2 0 7 11 1145141 998244353
output:
1 2 872
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 13ms
memory: 3672kb
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 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 ...
result:
wrong answer 502nd lines differ - expected: '0', found: '1'