POJ 2309 BST

最新推荐文章于 2020-08-04 22:38:30 发布

青瑟只鸟

最新推荐文章于 2020-08-04 22:38:30 发布

阅读量1.6k

点赞数

分类专栏： POJ 题目及解析

本文链接：https://blog.csdn.net/u011300443/article/details/9815313

版权

POJ 题目及解析专栏收录该内容

9 篇文章 0 订阅

订阅专栏

题目链接：
http://poj.org/problem?id=2309

难度级别： 2

BST

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7685		Accepted: 4654

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 <= 231 - 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

Source

POJ Monthly,Minkerui

#include"stdio.h"
int main()
{
	int n,t,T,cnt;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		t=n;
		cnt=0;
		while(1)
		{
			if(t&1)
				break;
			cnt++;
			t >>= 1;
		}
		t=(1<<cnt) - 1;
		printf("%d %d\n",n-t,n+t);

	}
	return 0;
}

yinjili

2309

Accepted

144K

16MS

C++

261B

2013-08-07 12:01:51