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. 样例输入 1717 4 7 12 555555 样例输出 1718 8 11 17 555557 #include<stdio.h> #include<iostream> #include<algorithm> #include<bitset> using namespace std; int main() { int n; while(scanf("%d",&n)!=EOF) { bitset<32>bitint(n); string s=bitint.to_string(); int pos=s.rfind("01"); swap(s[pos],s[pos+1]); if(pos+2<31) sort(s.begin()+pos+2,s.end()); cout<<bitset<32>(s).to_ulong()<<endl; } return 0; }