

F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15636 Accepted Submission(s): 5937 Problem Description For a decimal number x with n digits (A_{n}A_{n1}A_{n2} ... A_{2}A_{1}), we define its weight as F(x) = A_{n} * 2^{n1} + A_{n1} * 2^{n2} + ... + A_{2} * 2 + A_{1} * 1. Now you are given two numbers A and B, please calculate how many numbers are there between 0 and B, inclusive, whose weight is no more than F(A). Input The first line has a number T (T <= 10000) , indicating the number of test cases. For each test case, there are two numbers A and B (0 <= A,B < 10^{9}) Output For every case,you should output "Case #t: " at first, without quotes. The t is the case number starting from 1. Then output the answer. Sample Input
Sample Output
Source  
