POJ 2499 Binary Tree

标签：des   style   http   color   os   strong   io   for   

Description

Input

Output

Sample Input

3
42 1
3 4
17 73

Sample Output

Scenario #1:
41 0

Scenario #2:
2 1

Scenario #3:
4 6

Source

#include<iostream>
using namespace std;
int main()
{
    int N;
    cin>>N;

    int c;
    for(c=1;c<=N;c++)
    {
        int a,b;//节点标识
        cin>>a>>b;

        int left =0;
        int right=0;//左走的和右走的步数初始化

        while(a>1||b>1)//若未走到根
        {
            if(a>b)
            {
                int up;
                up=(a-1)/b;
                left=left+up;
                a=a-up*b;
            }
            else
            {
                int up;
                up=(b-1)/a;
                right=right+up;
                b=b-up*a;
            }
        }
        cout<<"Scenario #"<<c<<":"<<endl;
        cout<<left<<" "<<right<<endl<<endl;
    }
}

POJ 2499 Binary Tree,布布扣,bubuko.com

POJ 2499 Binary Tree

标签：des   style   http   color   os   strong   io   for   

原文地址：http://blog.csdn.net/sunshumin/article/details/38355629