mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-25 07:31:59 +00:00
B - And It's Non-Zero
https://codeforces.com/contest/1615/submission/140464543
This commit is contained in:
parent
2784afa33b
commit
523f43341f
25
CodeForces/1615/B/B.cpp
Normal file
25
CodeForces/1615/B/B.cpp
Normal file
@ -0,0 +1,25 @@
|
|||||||
|
#include <iostream>
|
||||||
|
|
||||||
|
using std::cin;
|
||||||
|
using std::cout;
|
||||||
|
using std::endl;
|
||||||
|
|
||||||
|
int t, l, r, b[200005][32];
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
for (int i = 1; i < 200005; i++) {
|
||||||
|
for (int k = 0; k < 32; k++) {
|
||||||
|
b[i][k] = b[i - 1][k] + ((i >> k) & 1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
cin >> t;
|
||||||
|
while (t--) {
|
||||||
|
cin >> l >> r;
|
||||||
|
int max = 0;
|
||||||
|
for (int k = 0; k < 32; k++) {
|
||||||
|
max = std::max(max, b[r][k] - b[l - 1][k]);
|
||||||
|
}
|
||||||
|
cout << r - l + 1 - max << endl;
|
||||||
|
}
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user