QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #644942 | #7735. Primitive Root | Dixiky_215 | WA | 10ms | 3672kb | C++20 | 1.3kb | 2024-10-16 16:06:54 | 2024-10-16 16:06:55 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN=5e5+7;
const int ep=505;
int t;
ll p,m;
ll get_num(ll x)
{
if(x<=0) return 0;
ll num=(x-1LL)/p+1;
return num;
}
int main()
{
cin.tie(nullptr) ->sync_with_stdio(false);
cin>>t;
while(t--)
{
cin>>p>>m;
if(m==0)
{
if(p==2) cout<<"1\n";
else cout<<"0\n";
continue;
}
ll lim=2*m/p;
if((2*m)%p) lim++;
ll ans=0LL;
ll sumk=0LL;
for(int i=62;i>=0;i--)
{
if(m&(1LL<<i))
{
ll lk,rk;
if((p-1LL)&(1LL<<i))
{
lk=sumk+(1LL<<i);
rk=lk+(1LL<<i)-1;
ans+=get_num(rk)-get_num(lk-1LL);
}
else
{
lk=sumk;
rk=lk+(1LL<<i)-1;
ans+=get_num(rk)-get_num(lk-1LL);
sumk+=(1LL<<i);
}
}
else
{
if((p-1LL)&(1LL<<i)) sumk+=(1LL<<i);
}
}
cout<<ans<<'\n';
}
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3672kb
input:
3 2 0 7 11 1145141 998244353
output:
1 2 872
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 10ms
memory: 3656kb
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 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 5...
result:
wrong answer 3rd lines differ - expected: '2', found: '1'