2017年10月26日
Valid Sets CodeForces - 486D
摘要： As you know, an undirected connected graph with n nodes and n - 1 edges is called a tree. You are given an integer d and a tree consisting of n nodes. 阅读全文
posted @ 2017-10-26 15:44 天之道，利而不害 阅读(339) 评论(0) 推荐(0) 编辑