NYOJ - Same binary weight

最新推荐文章于 2021-07-21 23:55:43 发布

SevenMIT

最新推荐文章于 2021-07-21 23:55:43 发布

阅读量810

点赞数

分类专栏： STL

本文链接：https://blog.csdn.net/SevenMIT/article/details/14122225

版权

STL 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Same binary weight

时间限制： 300 ms | 内存限制： 65535 KB

难度： 3

描述

The binary weight of a positive integer is the number of 1's in its binary representation.for example,the decmial number 1 has a binary weight of 1,and the decimal number 1717 (which is 11010110101 in binary) has a binary weight of 7.Give a positive integer N,return the smallest integer greater than N that has the same binary weight as N.N will be between 1 and 1000000000,inclusive,the result is guaranteed to fit in a signed 32-bit interget.

输入

The input has multicases and each case contains a integer N.

输出

For each case,output the smallest integer greater than N that has the same binary weight as N.

样例输入

样例输出

#include <iostream>
#include <string>
#include <bitset>

using namespace std;

int main(void)
{
    unsigned int n;
    while(cin >> n)
    {
        bitset <32> bs;   // 使用STL bitset来存储操作数的bit位
        int m = 0;
        while(n)
        {
            if(n&1)
                bs.set(m);
            m++;
            n >>= 1;
        }
        int count = 0;
        for(int i = 0; i < m; i++)   // 寻找到第一个01,将01转换为10。
        {
            if(bs.test(i))
            {
                count++;
                bs.reset(i);
                if(!bs.test(i+1))
                {
                    bs.set(i+1);
                    break;
                }
            }
        }
        for(int i = 0; i < count - 1; i++)  // 保持1的数量不变，将其低位全部置为1.
        {
            bs.set(i);
        }
        cout << bs.to_ulong() << endl;
    }
    return 0;
}