poj 2309 BST 使用树阵lowbit

#include<iostream>
#include<stdio.h>
using namespace std;
typedef long long ll;
ll lowbit(int x){
return x&(-x);
}
int main(){
ll n,a;
cin>>n;
while(n--){
cin>>a;
if(a%2!=0){
cout<<a<<" "<<a<<endl;
}
else{
ll max=a+lowbit(a)-1;
ll min=a-(max-a);
cout<<min<<" "<<max<<endl;
}
}
}