无奈滴微笑

旋转木马是最残忍的游戏, 彼此追逐却有永恒的距离...

SCU 4113 flip

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


阅读更多
个人分类: HUT训练
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

SCU 4113 flip

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭