Score : 600 points
We have a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and b_i. For each k=1, ..., N, solve the problem below:
Input is given from Standard Input in the following format:
N a_1 b_1 : a_{N-1} b_{N-1}
For each k=1, 2, ..., N in this order, print a line containing the answer to the problem.
3 1 2 1 3
2 1 1
The graph in this input is as follows:
For k=1, there are two ways in which we can write the numbers on the vertices, as follows:
2 1 2
1 1
The graph in this input is as follows:
5 1 2 2 3 3 4 3 5
2 8 12 3 3
The graph in this input is as follows:
8 1 2 2 3 3 4 3 5 3 6 6 7 6 8
40 280 840 120 120 504 72 72
The graph in this input is as follows: