QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#719892 | #7735. Primitive Root | OIer_kzc# | WA | 6ms | 3772kb | C++17 | 878b | 2024-11-07 09:39:33 | 2024-11-07 09:39:33 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define ll long long
int T;
int main(){
cin.tie(0)->sync_with_stdio(0);
cin>>T;
while(T){
--T;
ll p,m;
cin>>p>>m;
ll l=-1,r=(m/p)+3;
while(l<r){
ll mid=(l+r+1)/2;
ll u=(p*mid+1)^(p-1);
if(u<=m)l=mid;
else r=mid-1;
}
ll ans=l+1;
if(l<=3){
ans=0;
fo(k,0,6){
ll u=(p*k+1)^(p-1);
ans+=(u<=m);
}
}
else {
ans-=5;
l-=5;
fo(k,1,5){
ll u=(p*(k+l)+1)^(p-1);
ans+=(u<=m);
}
}
printf("%lld\n",ans);
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3772kb
input:
3 2 0 7 11 1145141 998244353
output:
1 2 872
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 6ms
memory: 3756kb
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 531st lines differ - expected: '10', found: '9'