UVA679

题目链接：https://cn.vjudge.net/problem/UVA-679

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. 

点：判断最后一个点到每个子节点的奇偶性，如果这个球是奇数个到达，那么它是下一个节点第（i+1）/2个球到达。

代码：

#include<iostream>
#include<cstring>

using namespace std;

int main()
{
	int t;
	while(cin>>t&&t!=-1)
	{
				while (t--)
				{
						int d, n;
						cin >> d >> n;
						long long k = 1;
						int cnt = 1;
						while (cnt<d)
						{
							if (n % 2)
							{
								k = 2 * k;
								n = (n + 1) / 2;
							}
							else
							{
								k = 2 * k + 1;
								n = n / 2;
							}
							cnt++;
						}
						cout << k << endl;
				}
			
	}
	system("pause");
	return 0;
}