POJ2309 BST

 1 //oimonster
 2 #include<cmath>
 3 #include<cstdio>
 4 #include<cstdlib>
 5 #include<iostream>
 6 using namespace std;
 7 int a[101],b[101],c[101];
 8 int main(){
 9     int i,j,n,p,t;
10     scanf("%d",&t);
11     while(t>0){
12         t--;
13         scanf("%d",&n);
14         p=n;
15         i=0;
16         while(p!=0){
17             i++;
18             a[i]=p%2;
19             p/=2;
20         }
21         n=i;
22         for(i=1;i<=n;i++){
23             b[i]=a[i];
24             c[i]=a[i];
25         }
26         j=1;
27         while(a[j]==0){
28             j++;
29         }
30         b[j]=0;
31         b[1]=1;
32         for(i=1;i<=j-1;i++){
33             c[i]=1;
34         }
35         int ans1,ans2;
36         ans1=ans2=0;
37         for(i=1;i<=n;i++){
38             ans1+=pow(2.0,i-1)*b[i];
39             ans2+=pow(2.0,i-1)*c[i];
40         }
41         printf("%d %d\n",ans1,ans2);
42     }
43     return 0;
44 }