Binary Tree(计算二叉树路径)
来源:互联网 发布:棉花云数据 编辑:程序博客网 时间:2024/06/14 08:20
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
超时
#include <iostream>using namespace std;int main(){int t,i;cin>>t;for(i=1;i<=t;i++){int r=0,l=0,m,n;cin>>m>>n;while(m!=1||n!=1){if(m>n){l++;m=m-n;}if(m<n){r++;n=n-m;}}cout<<"Scenario #"<<i<<":"<<endl;cout<<l<<" "<<r<<endl;}return 0;}
ac
#include <iostream>
using namespace std;
int main()
{int t,i;
cin>>t;
for(i=1;i<=t;i++)
{int r=0,l=0,m,n;
cin>>m>>n;
while(m!=1||n!=1)
{if(m>n)
{if(m%n)
{
l+= m/n;
m = m%n;
}
else
{
l+= (m/n-1);
m=1;
}
}
if(m<n)
{if(n%m)
{
r += n/m;
n = n%m;
}
else
{
r+= (n/m-1);
n = 1;
}
}
}
cout<<"Scenario #"<<i<<":"<<endl;
cout<<l<<" "<<r<<endl<<endl;
}
return 0;}
0 0
- Binary Tree(计算二叉树路径)
- Binary Tree Paths (二叉树路径遍历)
- (计算二叉树的路径9.2.1)POJ 2499 Binary Tree(走到根节点需要向左走向右走多少步)
- Binary Tree Maximum Path Sum 二叉树最大路径和
- 二叉树最大路径和 Binary Tree Max Path Sum
- LeetCode OJ 之 Binary Tree Paths(二叉树路径)
- [LintCode] 二叉树的路径之和 Binary Tree Path Sum
- lintcode binary-tree-paths 二叉树的所有路径
- 257. Binary Tree Paths 二叉树的路径
- Binary Tree Paths(二叉树的路径)
- 257. Binary Tree Paths(打印二叉树所有路径)
- 257. Binary Tree Paths | 二叉树的路径
- 257. Binary Tree Paths打印二叉树路径
- 【Leetcode】257 Binary Tree Paths 二叉树的路径
- 二叉树Binary Tree
- 二叉树 Binary Tree
- Binary tree,二叉树
- 二叉树(Binary Tree)
- 魔术师发牌问题(c++描述)
- add搜索栏
- ios tableview 那些事(二十七)tableview 下滑手势关闭键盘
- 模态对话框和非模态对话框
- cocos2d-x 字体使用方法浅析
- Binary Tree(计算二叉树路径)
- hdu 3605 Escape (二分图多重匹配)
- .Net 调用存储过程取到return的值
- study
- 第九天-面向对象(内部类、异常)
- Java获取hostname代码
- Java - 前置++和后置++
- 在Ubuntu 14.04 64bit上安装Valgrind并检查内存泄露
- Hashmap实现原理