摘要:
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 阅读全文
摘要:
Time limit : 8sec / Memory limit : 256MB Score : 1600 points Problem Statement Joisino is planning on touring Takahashi Town. The town is divided into 阅读全文
摘要:
Problem Statement Takahashi is hosting an sports meet. There are N people who will participate. These people are conveniently numbered 1 through N. Al 阅读全文
摘要:
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 阅读全文