An Easy Problem

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstdlib>
 4 #include<algorithm>
 5 #include<cmath>
 6 #include<cstring>
 7 using namespace std;
 8 int N;
 9 int a[100];
10 int binum[100];
11 inline void change(){
12     memset(a,0,sizeof(a));
13     memset(binum,0,sizeof(binum));
14     int tmp=N;
15     int now=1;
16     while(tmp/2>0){
17         a[now]=tmp%2;
18         tmp/=2;
19         now++;
20     }
21     a[now]=1;
22     a[0]=now;
23 }
24 inline void move(){
25     int i=1;
26     int cnt=0;
27     while(a[i]!=1||a[i+1]!=0){
28         if(a[i]==1) cnt++;
29         i++;
30     }
31     a[i+1]=1;
32     for(int k=1;k<=i;k++) a[k]=0;
33     for(int k=1;k<=cnt;k++) a[k]=1;
34 }
35 inline void calc(){
36     int ANS=0; 
37     int base=1;
38     for(int j=1;j<=a[0]+1;j++){
39         ANS+=a[j]*base;
40         base=base*2;
41     }
42     cout<<ANS<<endl;
43 }
44 int main(){
45     for(;;){
46         scanf("%d",&N);
47         if(N==0) break;
48         change();
49         move();
50         calc();            
51     }
52     return 0;
53 }