#include<stdio.h>
int main()
{
int i,j,k;
int a,b;
int t;
scanf("%d",&t);
while (t--)
{
scanf("%d",&a);
b=a+1;
k=a^b;
j=0;
while (k)
{
j+=k&1;
k=k>>1;
}
printf("%d\n",j);
}
return 0;
}
K
Time Limit: 1000 ms Memory Limit: 65536 kB Solved: 122 Tried: 173
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.
Simple Input
3
1
2
3
Simple Output
2
1
3