Range queries(bit manipulation)

This challenge like any other challenges is to test your ability, you skills at programming.

Quote:

I could only get the brute force method for the question.

There is different levels in brute force. You should show your code.

On 'geeksforgeeks.org', challenges are notoriously difficult and only your knowledge of algorithms and data structures can help you.

Generally speaking, brute force is the first solution one find, then a study of what is useful and what can be removed is the lead to a better solution.

This is my brute force logic

//
// Created by B Sriman on 10-07-2018.
//

#include <iostream>
using namespace std;

int main() {
    //code
    int t;
    cin>>t;
    while(t--){
        int q;
        cin>>q;
        while(q--){
            int l,r;
            cin>>l>>r;
            int total_count = 0;
            for(int i=l;i<=r;i++){
                int count = 0;
                int j = i;
                while(j){
                    j &= j-1;
                    count++;
                }
                if(count <= 3)
                    total_count++;
            }

            cout<<total_count<<endl;
        }
    }
    return 0;
}