[HackerEarth] There are N candies in a room labelled from 1 to N and there are N - 1 directed path between these candies such that every candy has at least 1 path leading to the candy or away from it. - 题解

暂无题解

题目信息
题号 P17717
标题 [HackerEarth] There are N candies in a room labelled from 1 to N and there are N - 1 directed path between these candies such that every candy has at least 1 path leading to the candy or away from it.
难度 提高
返回题目