POJ_2309_BST(位运算)

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;

int Lowbit(int t) {
return t & -t;
}

int main(){
int t,n;
while(~scanf("%d",&t)){
while(t--){
scanf("%d",&n);
int x = Lowbit(n) - 1;
printf("%d %d\n",n-x,n+x);
}
}
return 0;
}