An Easy Problem（模拟 C++）

最新推荐文章于 2024-05-16 20:31:41 发布

密码锁

最新推荐文章于 2024-05-16 20:31:41 发布

阅读量2.1k

点赞数 4

CC 4.0 BY-SA版权

分类专栏：模拟文章标签：短除

本文链接：https://blog.youkuaiyun.com/qq_42995099/article/details/82262847

给定一个正整数I，找出大于I且二进制中1的个数不变的最小整数J。通过短除法模拟计算二进制表示，寻找符合条件的J。

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

An Easy Problem
Total time limit: 1000 ms memory limit: 65536 kb
describe
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”.
input
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.
output
One integer per line, which is J.
Sample input</