SCU 4113 flip

原创于 2013-12-01 22:15:42 发布 · 862 阅读

0 ·

CC 4.0 BY-SA版权

HUT训练专栏收录该内容

37 篇文章

订阅专栏

本博客讨论了如何通过反转二进制数中的位来最小化将整数x增加到x+1所需的操作次数。

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
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;
}