2309.c

北京大学ACM比赛题目 Consider an infinite full binary search tree (see the figure below), the numbers in the

#include"stdio.h"
#include"math.h"
#include"string.h"
int main()
{ int x,p,N;
  int i,j;
  int min,max;
  scanf("%d",&N);
  for(j=1;j<=N;j++)
  { 
      scanf("%d",&x);
      if(x%2==1) {min=x; max=x;}
      else
      {
         for(i=30;i>0;i--)
      {
        p=pow(2,i-1);
    if(x%p==0) break;
    }
    //printf("%d\n",i);
    min=x-pow(2,i-1)+1;
    max=x+pow(2,i-1)-1;
    }
   printf("%d %d\n",min,max);
  }
}