mMingfunnyTree的博客

题目链接：http://acm.split.hdu.edu.cn/showproblem.php?pid=59712016icpc 区域赛 大连 题意： n 个人进行 m 场比赛，其中的 x 人被认为是“good player”，其中 y 人被认为是“ bad player ”，人们认为这些比赛只在good player 与bad player之间展开，问是否存在一种划分，使得参赛选手一定处于

7662 Perfect MatchingsGiven a graph G = (V, E), a matching in G is a set of pairwise non-adjacent edges; that is, no two edges share a common vertex. A perfect matching is a matching which matches all

7661 The Size of the Smallest HoleA cycle in an undirected graph consists of a sequence of different vertices except the starting vertex and the ending vertex, with each two consecutive vertices in th