UVa 699 The falling leaves:dfs traversing the binary tree

699-the Falling Leaves

Time limit:3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=640

Each year, fall in the "North" region is accompanied by the brilliant colors to the leaves on the trees, followed Ickly by the falling leaves accumulating under the trees. If the same thing happened to binary trees, how large would the piles of leaves become?

We assume each node in a binary "drops" a number of leaves equal to the integer value stored in that node. We also assume that this leaves drop vertically to the ground (thankfully, there ' s No. wind to blow them). Finally, we assume that's nodes are positioned horizontally in such a manner that's left and right children of a node are exactly one unit to "left" and one unit to the right, respectively, of their parent. Consider the following tree:

The nodes containing 5 and 6 have the same horizontal position (with different vertical positions, of course). The node containing 7 is one unit to the left of those containing 5 and 6, and the node containing 3 are one unit to their Right. When the ' leaves ' drop from these nodes, three piles are created:the leftmost one contains 7 leaves (from the leftmost no DE), the next contains (from the nodes containing 5 and 6), and the rightmost pile contains 3. (While it is true, the only leaf nodes in the tree would logically have leaves, we ignore, and this problem.)

Input

The input contains multiple test cases, each describing a. A's specified by giving the ' value in the ' root node, followed by the description of the ' left subtree, and then the de Scription of the right subtree. If a subtree is empty, the value-1 is supplied. Thus the shown above is specified as 5 7-1 6-1-1 3-1-1. Each actual tree node contains a positive, Non-zero value. The last test case was followed by a single-1 (which would otherwise represent, a empty tree).

Output

For the "case", display the case number (they are numbered sequentially, starting and 1) on a line by itself. On the ' next line ' Display the number of ' leaves ' in each pile, from left to right, with a single spaces separating each Valu E. This display must start in column 1, and would not exceed the width of a 80-character line. Follow the output for each case by a blank line. This format is illustrated in the examples below.

Sample Input

5 7-1 6-1-1 3-1-1
8 2 9-1-1 6 5-1-1 12-1
-1 3 7-1 -1-1
-1

Sample Output

Case 1:
7-3 Case

2:
9 7 21 15

Water problem.

Complete code:

/*0.046s*/
    
#include <cstdio>  
#include <cstring>  
    
int pile[200], temp;  
Char str[1000];  
    
void Dfs (int pos)  
{  
    scanf ("%d", &temp);  
    if (Temp < 0) return;  
    Pile[pos] + + temp;  
    DFS (POS-1);  
    DFS (pos + 1);  
}  
    
int main ()  
{  
    int cas = 0, I;  
    while (scanf ("%d", &pile[100]), pile[100] > 0)  
    {  
        Dfs;  
        DFS (a);  
        printf ("Case%d:\n", ++cas);  
        for (i = 0;!pile[i]; ++i)  
            ;  
        for (; pile[i + 1]; ++i)  
            printf ("%d", Pile[i]);  
        printf ("%d\n\n", Pile[i]);  
        memset (pile, 0, sizeof (pile));  
    }  
    return 0;  
}

See more highlights of this column: http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/