Dropping Balls (UVA - 679)

版权声明：欢迎转载!拒绝抄袭. https://blog.csdn.net/qq_36257146/article/details/87809630

A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visits a non-terminal node. It then keeps moving down, either follows the path of the left subtree, or follows the path of the right subtree, until it stops at one of the leaf nodes of FBT. To determine a ball’s moving direction a flag is set up in every non-terminal node with two values, either false or true. Initially, all of the flags are false. When visiting a non-terminal node if the flag’s current value at this node is false, then the ball will first switch this flag’s value, i.e., from the false to the true, and then follow the left subtree of this node to keep moving down. Otherwise, it will also switch this flag’s value, i.e., from the true to the false, but will follow the right subtree of this node to keep moving down. Furthermore, all nodes of FBT are sequentially numbered, starting at 1 with nodes on depth 1, and then those on depth 2, and so on. Nodes on any depth are numbered from left to right.

#include <iostream>
#include <bits/stdc++.h>
#define maxn 20
using namespace std;
bool open[1<<maxn];

int main()
{
    int D,I,n;
    while(cin>>n&&n!=-1)
    {
        for(int i = 0;i<n;i++)
        {
            int y = 1;
            cin>>D>>I;
            for(int i = 0;i<D-1;i++)
            {
                if(I%2)
                {
                    y = 2*y;
                    I = (I+1)/2;
                }
                else
                {
                    y = 2*y+1;
                    I = I/2;
                }

            }cout<<y<<endl;
        }

    }
    return 0;
}