CF1527A.And Then There Were K

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

Given an integer $n$ , find the maximum value of integer $k$ such that the following condition holds:

$n$ & ( $n-1$ ) & ( $n-2$ ) & ( $n-3$ ) & ... ( $k$ ) = $0$ where & denotes the bitwise AND operation.

输入格式

The first line contains a single integer $t$ ( $1 \le t \le 3 \cdot 10^4$ ). Then $t$ test cases follow.

The first line of each test case contains a single integer $n$ ( $1 \le n \le 10^9$ ).

输出格式

For each test case, output a single integer — the required integer $k$ .

输入输出样例

输入#1
```
3
2
5
17
```
输出#1
```
1
3
15
```

说明/提示

In the first testcase, the maximum value for which the continuous & operation gives 0 value, is 1.

In the second testcase, the maximum value for which the continuous & operation gives 0 value, is 3. No value greater then 3, say for example 4, will give the & sum 0.

$5 \, \& \, 4 \neq 0$ ,
$5 \, \& \, 4 \, \& \, 3 = 0$ .

Hence, 3 is the answer.

首页