Sudo Placement | Range Queries

Given Q queries, with each query consisting of two integers L and R, the task is to find the total numbers between L and R (Both inclusive), having almost three set bits in their binary representation. 
Examples: 
 

Input : Q = 2
 L = 3, R = 7
 L = 10, R = 16
Output : 5
 6
For the first query, valid numbers are 3, 4, 5, 6, and 7.
For the second query, valid numbers are 10, 11, 12, 13, 14 and 16.

Prerequisites : Bit Manipulation and Binary Search
 

Method 1 (Simple): A naive approach is to traverse all the numbers between L and R and find the number of set bits in each of those numbers. Increment a counter variable if a number does not have more than 3 set bits. Return answer as counter. Note : This approach is very inefficient since the numbers L and R may have large values (upto 10¹⁸).
Method 2 (Efficient) : An efficient approach required here is precomputation. Since the values of L and R lie within the range [0, 10¹⁸] (both inclusive), thus their binary representation can have at most 60 bits. Now, since the valid numbers are those having almost 3 set bits, find them by generating all bit sequences of 60 bits with less than or equal to 3 set bits. This can be done by fixing, i^th, j^th and k^th bits for all i, j, k from (0, 60). Once, all the valid numbers are generated in sorted order, apply binary search to find the count of those numbers that lie within the given range.
Below is the implementation of above approach. 
 

5
6

Time Complexity : O((Maximum Number of Bits)³ + Q * logN), where Q is the number of queries and N is the size of set containing all valid numbers. l valid numbers.