2309 BST

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

2
8
10

Sample Output

1 15
9 11

很有意思的一道题，我在纸上画了一下题目中BST的树状数组找出了规律，不得不说它真的挺神奇。对于一个子树根x，它的左子树是它覆盖的区间，最小值即为区间的最左端；右子树是覆盖它的区间，最大值即为区间的第二最右端，最右端是x的根。关键还是lowbit()这个运算

#include <iostream>
#include <cstdio>
#define lowbit(i) (i & (-i))

using namespace std;

int main()
{
    int n, x;
    scanf("%d", &n);
    while(n--)
    {
        scanf("%d", &x);
        int l = x - lowbit(x) + 1;
        long long r = x + lowbit(x) - 1;
        printf("%d %lld\n", l, r);
    }
    return 0;
}