# 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 rst 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 ag is set up in every non-terminal node with two values, either false or true. Initially, all of the ags are false. When visiting a non-terminal node if the ag’s current value at this node is false, then the ball will rst switch this ag’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 ag’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.
For example, Fig. 1 represents a fully binary tree of maximum depth 4 with the node numbers 1, 2, 3, …, 15. Since all of the ags are initially set to be false, the rst ball being dropped will switch ag’s values at node 1, node 2, and node 4 before it nally stops at position 8. The second ball being dropped will switch ag’s values at node 1, node 3, and node 6, and stop at position 12. Obviously, the third ball being dropped will switch ag’s values at node 1, node 2, and node 5 before it stops at position 10.
Now consider a number of test cases where two values will be given for each test. The rst value is D, the maximum depth of FBT, and the second one is I, the I-th ball being dropped. You may assume the value of I will not exceed the total number of leaf nodes for the given FBT.

Please write a program to determine the stop position P for each test case. For each test cases the range of two parameters D and I is as below:
Input
Contains l + 2 lines.
2≤D≤20, and1≤I≤524288.

## my code ：


//UVA 679 Droping balls
#include "iostream"
#include "cstdio"
#include "cmath"
using namespace std;

int main (){
int n,b,c;
int k = 1;
cin>>n;
for (int i = 1; i <= n; i++) {
cin >> b >> c;
if (b <= 20) {
int deep = (1<<b) - 1;
int bstack[deep];
memset(bstack, 0, sizeof(bstack));
for (int j = 0; j < c ;j++ ){
k = 1;
for ( ; ; ) {
bstack[k] =! bstack[k];
k = bstack[k] ? k*2:k*2+1;
if (k > deep ) {
break;
}
}

}

}else{
cout << "TOO DEEP" <<endl;
}
}
cout << k/2 << endl;
return 0;

}



• 本文已收录于以下专栏：

## uva 679 Dropping Balls

uva 679 Dropping Balls

## uva679 Dropping Balls

A number ofKballs are dropped one by one from the root of a fully binary tree structure FBT. Eachti...

## Dropping Balls, UVa679

• itbsl
• 2017-07-13 10:26
• 57

## UVA-679 Dropping Balls

A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each ...

## UVA - 679 Dropping Balls

A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each ...

## UVa 679 - Dropping Balls 数学分析

Dropping Balls A number of K balls are dropped one by one from the root of a fully binary tree struc...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)