{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n Write a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest common ancestor of u and v in the tree. The closest common ancestor of two nodes u and v is the node w that is an ancestor of both u and v and has the greatest depth in the tree. A node can be its own ancestor (for example in Figure 1 the ancestors of node 2 are 2 and 5)\n \u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n The data set, which is read from a the std input, starts with the tree description, in the form: \n \u003cbr\u003e \n \u003cbr\u003enr_of_vertices \n \u003cbr\u003e vertex:(nr_of_successors) successor1 successor2 ... successorn \n \u003cbr\u003e ... \n \u003cbr\u003ewhere vertices are represented as integers from 1 to n ( n \u0026lt;\u003d 900 ). The tree description is followed by a list of pairs of vertices, in the form: \n \u003cbr\u003e nr_of_pairs \n \u003cbr\u003e(u v) (x y) ... \n \u003cbr\u003e \n \u003cbr\u003eThe input file contents several data sets (at least one). \n \u003cbr\u003eNote that white-spaces (tabs, spaces and line breaks) can be used freely in the input.\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n SBDJ\n For each common ancestor the program prints the ancestor and the number of pair for which it is an ancestor. The results are printed on the standard output on separate lines, in to the ascending order of the vertices, in the format: ancestor:times \n \u003cbr\u003eFor example, for the following tree: \n \u003cbr\u003e\n \u003ccenter\u003e\n \u003cimg src\u003d\"CDN_BASE_URL/f3543bc96c2a6975718af0ddff6b73a7?v\u003d1510988888\" SRC\u003d\"CDN_BASE_URL/f3543bc96c2a6975718af0ddff6b73a7?v\u003d1510988888\"\u003e\n \u003c/center\u003e\n \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e5\n5:(3) 1 4 2\n1:(0)\n4:(0)\n2:(1) 3\n3:(0)\n6\n(1 5) (1 4) (4 2)\n (2 3)\n(1 3) (4 3)\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e2:1\n5:5\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n Huge input, scanf is recommended.\n \u003c/div\u003e"}},{"title":"","value":{"format":"HTML","content":""}}]}