Akku likes binary numbers and she likes playing with these numbers. Her teacher once gave her a question.For given value of L and R, Akku have to find the count of number X, which have only three-set bits in it's binary representation such that "L <= X <= R".Akku is genius, she solved the problem easily. Can you do it ??
The first line of input contains of an integer T i.e number of test cases. Next T lines contains two space seperated integers L,R
Output consists of T lines each indicating the answer for each test case.
1 <= T <= 10000
1 <= L <= R <= 10^18
Sample Input :
Sample Output :
There are 4 such numbers with 3 set bits in range 11 to 19.
11 -> 1011
13 -> 1101
14 -> 1110
19 -> 10011
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.