F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist

C/C++/Java Exams
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
DIY | Web-DIY beta
Register new ID

# The Next

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3027    Accepted Submission(s): 1063

Problem Description
Let $L$ denote the number of 1s in integer $D$’s binary representation. Given two integers $S_1$ and $S_2$, we call $D$ a WYH number if $S_1≤L≤S_2$.
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$, $S_1$, and $S_2$, as described above. It is guaranteed that $0≤D<2^{31}$ 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

Statistic | Submit | Discuss | Note
 Home | Top Hangzhou Dianzi University Online Judge 3.0 Copyright © 2005-2024 HDU ACM Team. All Rights Reserved. Designer & Developer : Wang Rongtao LinLe GaoJie GanLu Total 0.000000(s) query 1, Server time : 2024-08-14 19:14:00, Gzip enabled Administration