【小米oj】 反向位整数

模拟

#define mm(a) memset(a,0,sizeof(a));
#define max(x,y) (x)>(y)?(x):(y)
#define min(x,y) (x)<(y)?(x):(y)
#define Fopen freopen("1.in","r",stdin); freopen("m.out","w",stdout);
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,b,a) for(int i=(b);i>=(a);i--)
#include<bits/stdc++.h>
typedef long long ll;
#define PII pair<ll,ll>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=(int)2e5 + 5;
const ll mod=1e9+7;


char s[MAXN];
unsigned int n;

int main()
{
    ll ans=0;
    scanf("%u",&n);

    for(int i=0;i<32;i++){
        ans<<=1;
        if(n&(1<<i))ans|=1;
    }
    printf("%lld
",ans);
    return 0;
}