CF484A.Bits

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Let's denote as the number of bits set ('1' bits) in the binary representation of the non-negative integer $x$ .

You are given multiple queries consisting of pairs of integers $l$ and $r$ . For each query, find the $x$ , such that $l<=x<=r$ , and is maximum possible. If there are multiple such numbers find the smallest of them.

输入格式

Let's denote as the number of bits set ('1' bits) in the binary representation of the non-negative integer $x$ .

输出格式

For each query print the answer in a separate line.

输入输出样例

输入#1
```
3
1 2
2 4
1 10
```
输出#1
```
1
3
7
```

说明/提示

Let's denote as the number of bits set ('1' bits) in the binary representation of the non-negative integer $x$ .

首页