P8567 [JRKSJ R6] Nothing

[An image should be here.]

We define $f(x)$ as the position of the lowest $1$ in the binary representation of $x$ (note that the lowest bit in binary is bit $0$). The following is the code in `C++` (without considering issues caused by data types): ```c++ int f(int x){ int ans = 0; while (x % 2 == 0){ x /= 2; ans += 1; } return ans; } ``` There are $T$ queries. For each query, given an interval $[l,r]$, find how many integers $i\in [l,r]$ satisfy $f(i)< f(i+1)$.

The first line contains a positive integer $T$. The next $T$ lines each contain two positive integers $l,r$, representing one query.

Output $T$ lines, each containing one integer, the answer.

### Constraints This problem uses bundled testdata. | $\text{Subtask}$ | $T\le$ | Special constraints | $\text{Score}$ | | :----------: | :----------: | :----------: | :----------: | | $1$ | $10^5$ | $l=r$ | $10$ | | $2$ | $10^4$ | $r-l\le10^3$ | $30$ | | $3$ | $10^5$ | $r\le10^6$ | $20$ | | $4$ | $10^5$ | None | $40$ | For $100\%$ of the testdata, $1\le T\le 10^5$, $1\le l\le r\le 10^{18}$. Translated by ChatGPT 5