poj 2499 Binary Tree(超简单的二叉树)
来源:互联网 发布:淘宝新店上下架时间 编辑:程序博客网 时间:2024/05/05 03:41
Binary Tree
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5628 Accepted: 2623
Description
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:
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?
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.
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
342 13 417 73
Sample Output
Scenario #1:41 0Scenario #2:2 1Scenario #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;
}
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;
}
[Submit] [Go Back] [Status] [Discuss]
- poj 2499 Binary Tree(超简单的二叉树)
- poj 2499 binary tree (平衡二叉树)
- 二叉搜索树的简单实现(Binary Search Tree)
- 二叉树(binary tree)
- 二叉树(Binary Tree)
- 二叉树(binary tree)
- 二叉树Binary Tree
- 二叉树 Binary Tree
- Binary tree,二叉树
- 二叉树(Binary Tree)
- Binary Tree 二叉树
- (计算二叉树的路径9.2.1)POJ 2499 Binary Tree(走到根节点需要向左走向右走多少步)
- 二叉查找树(binary search tree)的实现
- 二叉搜索树(Binary Search Tree)的查找
- LeetCode:Balanced Binary Tree(平衡二叉树的判断)
- Binary Tree Paths(二叉树的路径)
- 543. Diameter of Binary Tree (二叉树的直径)
- 二叉树 (Binary Tree)的遍历
- FFT用C/C++语言实现,在VC上成功应用
- 数据结构----循环链表
- Window 消息
- 两个android程序间的相互调用(apk互调)
- iOS6下关于屏幕旋转的控
- poj 2499 Binary Tree(超简单的二叉树)
- Git Command Quick Reference
- linux相关知识之特殊符号做目录
- 数据窗口技巧
- 数据结构-----双向循环链表
- 网络第一课(2)
- [C#] 简单的分支语句
- java--开发者应该避免使用的6个Java功能
- 实现就地逆置单链表