The Next
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1781 Accepted Submission(s): 672
Problem Description
Let
L
denote the number of 1s in integer
D
’s binary representation. Given two integers
S1
and
S2
, we call
D
a WYH number if
S1≤L≤S2
.
With a given D , we would like to find the next WYH number Y , which is JUST larger than D . In other words, Y is the smallest WYH number among the numbers larger than D . Please write a program to solve this problem.
With a given D , we would like to find the next WYH number Y , which is JUST larger than D . In other words, Y is the smallest WYH number among the numbers larger than D . Please write a program to solve this problem.
Input
The first line of input contains a number
T
indicating the number of test cases (
T≤300000
).
Each test case consists of three integers D , S1 , and S2 , as described above. It is guaranteed that 0≤D<231 and D is a WYH number.
Each test case consists of three integers D , S1 , and S2 , as described above. It is guaranteed that 0≤D<231 and D is a WYH number.
Output
For each test case, output a single line consisting of “Case #X: Y”.
X
is the test case number starting from 1.
Y
is the next WYH number.
Sample Input
3 11 2 4 22 3 3 15 2 5
Sample Output
Case #1: 12 Case #2: 25 Case #3: 17
Source
Recommend
题意:找到一个最小的大于D的数,使它的二进制中1的个数在s1~s2之间。
思路:从D+1开始找,如果1的个数小于s1,的数y,将y的二进制位从左到右0的变为1,最后转化为十进制,如果1的个数大于s2跳过
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define LL __int64
using namespace std;
LL tol,t,s1,s2,d[44],f;
LL get(LL x)//将x转化为二进制,并计算X的二进制中1的个数
{
LL num=0,t=0;
while(x)
{
d[t++]=x%2;
if(x&1)
{
num++;
}
x=x/2;
}
return num;
}
int main()
{
LL T,D,i,j,k,cant=1;
scanf("%I64d",&T);
while(T--)
{
memset(d,0,sizeof(d));
scanf("%I64d%I64d%I64d",&D,&s1,&s2);
LL y,dis=0;
LL sum;
do
{
dis++;//从D+1开始找
y=D+dis;
sum=get(y);
if(sum<s1)
{
LL add=s1-sum;
j=0;
while(add)
{
if(d[j]==0)
{
d[j]=1;
add--;
}
j++;
}
break;
}
}while(sum<s1||sum>s2);
LL ans=0,temp=1;
for(i=0;i<40;i++)
{
if(d[i])
ans+=temp;
temp<<=1;
}
printf("Case #%I64d: ",cant++);
printf("%I64d\n",ans);
}
return 0;
}