Binary Tree

时间：2014-08-01 19:39:52 阅读：207 评论：0 收藏：0 [点我收藏+]

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:

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*10⁹) 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

Sample Output

Scenario #1:
41 0

Scenario #2:
2 1

Scenario #3:
4 6

#include<iostream>
using namespace std;
int main()
{
	int sc;
	cin>>sc;
	int i;
	for(i=0;i<sc;i++)
	{
		cout<<"Scenario #"<<i+1<<":"<<endl;
		int a,b;
		cin>>a>>b;
		int l=0,r=0;
		while(a>1||b>1)
		{
		if(a>b)
		{
              int up=0;
			  up=(a-1)/b;
			  l+=up;
			  a-=up*b;
		}
		else
		{int up=0;
			  up=(b-1)/a;
			  r+=up;
			  b-=up*a;}
		}
		cout<<l<<' '<<r<<endl<<endl;
	}
return 0;
}

Binary Tree,布布扣,bubuko.com

Binary Tree

标签：des style color os strong io for art

原文地址：http://blog.csdn.net/rememberautumn/article/details/38341303

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行