2015年10月13日
摘要: They say that Berland has exactly two problems, fools and roads. Besides, Berland hasncities, populated by the fools and connected by the roads. All B... 阅读全文
posted @ 2015-10-13 13:18 _fukua 阅读(437) 评论(0) 推荐(0) 编辑
摘要: As you know, an undirected connected graph withnnodes andn - 1edges is called atree. You are given an integerdand a tree consisting ofnnodes. Each nod... 阅读全文
posted @ 2015-10-13 12:23 _fukua 阅读(300) 评论(0) 推荐(0) 编辑