2011年10月17日
树的判定
摘要： 判断输入的是不是一棵树输入The input will consist of a sequence of descriptions (test cases) followed by a pair of negative integers. Each test case will consist of a sequence of edge descriptions followed by a pair of zeroes Each edge description will consist of a pair of integers; the first integer identifies t 阅读全文
posted @ 2011-10-17 15:33 qijinbiao1 阅读(264) 评论(0) 推荐(0)