POJ 2309 BST

Description

Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the maximum number by going down the right node. Now you are given some queries as "What are the minimum and maximum numbers in the subtree whose root node is X?" Please try to find answers for there queries. 

Input

In the input, the first line contains an integer N, which represents the number of queries. In the next N lines, each contains a number representing a subtree with root number X (1 <= X <= 2³¹ - 1).

Output

There are N lines in total, the i-th of which contains the answer for the i-th query.

Sample Input

2810

Sample Output

1 159 11

Source

POJ Monthly,Minkerui

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

其实算不上是树状数组吧，只是用到了树状数组中lowbit的思路，相当于题目本身给了一个树状数组然后单点查询~

（神奇的题）

（其实这个式子记住就可以了吧推导好麻烦的呐）

#include<iostream>using namespace std;int t;long long k;int main(){scanf("%d",&t);for(int i=1;i<=t;i++){scanf("%lld",&k);printf("%lld %lld\n",k-(k&(-k))+1,k+(k&(-k))-1);}return 0;}