2020年4月19日
hdu 4912
摘要： Paths on the treeProblem Descriptionbobo has a tree, whose vertices are conveniently labeled by 1,2,…,n.** There are m paths on the tree. bobo would l 阅读全文
posted @ 2020-04-19 16:58 傲-寒 阅读(89) 评论(0) 推荐(0) 编辑