## [SOLUTION] Count Possibilities SOLUTION CODECHEF

Problem SOLUTION CODECHEF You are given a directed tree with �N vertices. The edges are directed away from the root. For each �=1,2,3,…,�i=1,2,3,…,N, count the number of vertices that can possibly appear at the �i-th position of a topological order of this tree. That is, for each �i, find the number of vertices �u such that there exists a topological order �T of the graph satisfying ��=�Ti=u. Input Format … Read more