309034: CF1615B. And It's Non-Zero
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
And It's Non-Zero
题意翻译
给定一个包含 $[l,r]$ 范围内所有整数的数组,求最少要删除多少元素,使得这个数组里面所有元素按位与之后的结果非零? 数据范围: - $t$ 组数据,$1\leqslant t\leqslant 10^4$。 - $1\leqslant l\leqslant r\leqslant 2\times 10^5$。 Translated by Eason_AC 2021.12.25题目描述
You are given an array consisting of all integers from $ [l, r] $ inclusive. For example, if $ l = 2 $ and $ r = 5 $ , the array would be $ [2, 3, 4, 5] $ . What's the minimum number of elements you can delete to make the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of the array non-zero? A bitwise AND is a binary operation that takes two equal-length binary representations and performs the AND operation on each pair of the corresponding bits.输入输出格式
输入格式
The first line contains one integer $ t $ ( $ 1 \leq t \leq 10^4 $ ) — the number of test cases. Then $ t $ cases follow. The first line of each test case contains two integers $ l $ and $ r $ ( $ 1 \leq l \leq r \leq 2 \cdot 10^5 $ ) — the description of the array.
输出格式
For each test case, output a single integer — the answer to the problem.
输入输出样例
输入样例 #1
5
1 2
2 8
4 5
1 5
100000 200000
输出样例 #1
1
3
0
2
31072