## Description

Give you a non-negative integer x and an operation. The only operation you can do is to reverse one bit in binary form of x once(i.e 1->0, 0->1). your goal is to turn x into x+1. Calculate the minimum times of operations you need to do.

## Input

The first line of the input is an integer T indicates the test cases. Then follow T lines. Each line is a non-negative integer x as described above, note that 0<=x<10^9.

## Output

Output the minimum times of operations you need to do to reach the goal.

3 1 2 3

## Sample Output

2 1 3
题解：就是比较两个数字的二进制表示方式0和1的不同位置有多少个。
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int T,t,x,y;
scanf("%d",&T);
while (T--)
{
scanf("%d",&x);
y=x+1;
int t=0;
while (x || y)
{
if (x % 2 != y % 2) t++;
x/=2;
y/=2;
}
printf("%d\n",t);
}
return 0;
}

#### scu（snoop control unit）

2014-05-05 16:07:09

#### SCU4440-Rectangle

2017-04-26 15:01:11

#### SCU 4437 Carries 想法题

2015-10-01 20:01:24

#### [SCU 4504] 奶牛合影 （最小表示法）

2016-05-11 12:54:33

#### SCU 4440: Rectangle（规律）

2017-05-02 22:42:48

#### SCU 4441 Necklace (2015四川省省赛F题)

2015-06-25 09:56:27

#### scu 4440 Rectangle

2016-08-18 19:05:40

#### scu 4444 travel

2015-10-02 17:09:40

#### [SCU 4499] 表达式 （IDA*）

2016-05-10 21:26:47

#### scu oj 4437: Carries （2015年四川省程序ACM设计竞赛B题目 ）

2015-06-16 13:24:02

SCU 4113 flip