贪心01

贪心思路
As we known, data stored in the computers is in binary form. The problem we discuss now is about the positive integers and its binary form.

Given a positive integer I, you task is to find out an integer J, which is the minimum integer greater than I, and the number of '1’s in whose binary form is the same as that in the binary form of I.

For example, if “78” is given, we can write out its binary form, “1001110”. This binary form has 4 '1’s. The minimum integer, which is greater than “1001110” and also contains 4 '1’s, is “1010011”, i.e. “83”, so you should output “83”.

			输入
	One integer per line, which is I (1 <= I <= 1000000).

A line containing a number “0” terminates input, and this line need not be processed.
输出
One integer per line, which is J.
样例输入
1
2
3
4
78
0

	样例输出
	2

4
5
8
83
第一次贪心的思路
那时候就听了三个例题，装载箱，书包，钱。用比较的思路。
当时的笔记：
输入i
转二进制测1的个数
自增找1的相同的个数
输出j
一开始想用模反着做，然后发现用移位>>可以
先写一个函数测出1的个数，就不用反复循环求
然后给i自增找出j
数1函数用了移位 和按位与
const int MAX_BIT=32;
int CountOne(int input)
{
int cnt=0;
for (int i=0; i<MAX_BIT; i++)
{
if (input>>i&1)
{
cnt++;
}
}
return cnt;
}
随后自增输出j就好了
注意要break
不然不停下。