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.
Sample Input 3
Sample Output 2
using namespace std;
while (x || y)
if (x % 2 != y % 2) t++;