1455:An Easy Problem(4.6算法之贪心)

最新推荐文章于 2023-09-13 09:23:59 发布

原创

最新推荐文章于 2023-09-13 09:23:59 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

给定一个正整数I，任务是找到大于I的最小整数J，其二进制表示中1的个数与I相同。例如，对于78（1001110），最小的满足条件的数是83（1010011）。程序需处理1到1000000的整数，以0结束。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1455:An Easy Problem

总时间限制: 1000ms 内存限制: 65536kB
描述
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