本文主要是介绍poj 2499 Binary Tree，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
题目链接：点击打开链接
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
3
42 1
3 4
17 73
Sample Output
Scenario #1:
41 0Scenario #2:
2 1Scenario #3:
4 6
题意：根（a,b），则左孩子为（a+b,b），右孩子为（a,a+b）给定（m,n），初试根为（1,1）,从（1,1）到（m,n）需要往左子树走几次，
往右子树走几次。
ps：逆向思维，从（m,n）到（1,1）。
给定（m,n），求其父亲，如果m>n，则他父亲是（m-n,n），
否则（m,n-m）。
<span style="font-size:24px;">#include<iostream>
#include<cstring>using namespace std;int main()
{int n;cin>>n;int a,b;for(int i=1;i<=n;i++){cin>>a>>b;int l,r;l=r=0;while(a!=1||b!=1){if(a>=b){if(a%b){l=l+a/b;a=a%b;}else{l=l+a/b-1;a=1;}}else{if(b%a){r=r+b/a;b=b%a;}else{r=r+b/a-1;b=1;}}}cout<<"Scenario #"<<i<<":\n";cout<<l<<" "<<r<<endl<<endl;}return 0;
}</span>这篇关于poj 2499 Binary Tree的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
