poj 2499 Binary Tree(超简单的二叉树)
2013-10-22 22:17
393 查看
Binary Tree
Background Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. The tree is constructed like this: The root contains the pair (1, 1). If a node contains (a, b) then its left child contains (a + b, b) and its right child (a, a + b) Problem Given the contents (a, b) of some node of the binary tree described above, suppose you are walking from the root of the tree to the given node along the shortest possible path. Can you find out how often you have to go to a left child and how often to a right child? Input The first line contains the number of scenarios. Every scenario consists of a single line containing two integers i and j (1 <= i, j <= 2*109) that represent a node (i, j). You can assume that this is a valid node in the binary tree described above. Output The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Then print a single line containing two numbers l and r separated by a single space, where l is how often you have to go left and r is how often you have to go right when traversing the tree from the root to the node given in the input. Print an empty line after every scenario. Sample Input 3 42 1 3 4 17 73 Sample Output Scenario #1: 41 0 Scenario #2: 2 1 Scenario #3: 4 6 Source TUD Programming Contest 2005 (Training Session), Darmstadt, Germany 呵呵,做题就应该好好读题。坑死我了。 AC掉了的代码: #include<stdio.h> int main() { int i=0; int N; scanf("%d",&N); while(i<N) { int a,b; int left=0,right=0; scanf("%d%d",&a,&b); while(a!=1 || b!=1) { if(a>b) { left+=(a-1)/b; a=(a-1)%b+1; } else { right+=(b-1)/a; b=(b-1)%a+1; } } printf("Scenario #%d:\n%d %d\n\n",++i,left,right); } return 0; } |
Back] [Status] [Discuss]
相关文章推荐
- POJ 2499 Binary Tree(二叉树,找规律)
- (计算二叉树的路径9.2.1)POJ 2499 Binary Tree(走到根节点需要向左走向右走多少步)
- POJ 2499 Binary Tree(水题)
- POJ 2499 Binary Tree
- poj 2499 Binary Tree(水题)
- POJ 2499 Binary Tree
- POJ 2499 求二叉树结点到根结点的路径长度 递归 二叉树
- POJ 2499 求二叉树结点到根结点的路径长度 递归 二叉树
- POJ 2499 Binary Tree 递推 贪心
- poj 2499 binary tree (平衡二叉树)
- POJ 2499 Binary Tree
- POJ 2499 Binary Tree 数学题解
- poj 2499 Binary Tree
- Binary Tree(POJ--2499
- POJ 2499 - Binary Tree
- POJ 2499 Binary Tree
- POJ-2499 Binary Tree
- POJ 2499 Binary Tree
- poj 2499 Binary Tree
- poj 2499 Binary Tree