POJ2309 BST
来源:互联网 发布:软件行业新技术 编辑:程序博客网 时间:2024/06/08 04:04
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
2810
Sample Output
1 159 11
#include <cstdio>#include<iostream>#include <math.h>using namespace std;int main(){int n;scanf("%d",&n);while(n--){int s;scanf("%d",&s);int k=s&(-s);k--;printf("%d %d\n",s-k,s+k);}return 0;}
原文请访问:http://xiaoshig.sinaapp.com/?p=197
2 0
- poj2309 BST
- POJ2309 BST
- poj2309(BST)
- POJ2309 BST
- POJ2309 BST
- poj2309——BST
- POJ2309--BST--树状数组
- POJ2309 BST(树状数组)
- poj2309
- POJ2309
- poj2309解题报告
- BST
- BST
- BST
- BST
- BST
- BST
- bst
- 打算学学android,先从环境搭建开始
- Tomcat conf/servlet.xml 配置
- aws 价格
- matlab meshgrid() 函数
- scala学习十二 并发编程二 actor模型
- POJ2309 BST
- java script发布时要精简代码
- 博弈总结
- The Louvain method for community detection
- 微信公布文章阅读量 淘宝随即开发“新生意”
- 网络html查看器
- msyql.db误删,重新创建
- java汉字转拼音,取汉字首字母,支持繁体
- 有了malloc/free为什么还要new/delete ?