摘要: D - Tree and Hamilton Path Time limit : 2sec / Memory limit : 256MB Score : 1100 points Problem Statement There is a tree with N vertices, numbered 1  阅读全文
posted @ 2017-07-24 18:30 perplex 阅读(367) 评论(3) 推荐(0) 编辑
摘要: Time limit : 8sec / Memory limit : 256MB Score : 1600 points Problem Statement Joisino is planning on touring Takahashi Town. The town is divided into 阅读全文
posted @ 2017-07-24 18:21 perplex 阅读(205) 评论(0) 推荐(0) 编辑
摘要: Problem Statement Takahashi is hosting an sports meet. There are N people who will participate. These people are conveniently numbered 1 through N. Al 阅读全文
posted @ 2017-07-24 00:18 perplex 阅读(360) 评论(0) 推荐(0) 编辑
摘要: Problem Statement There are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has Ai gold coins, Bi silver coins and Ci bronze coins. Snuk 阅读全文
posted @ 2017-07-24 00:15 perplex 阅读(297) 评论(0) 推荐(0) 编辑