摘要：
Balancing Act Description Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collect 阅读全文
posted @ 2016-08-30 14:43
stort
阅读(164)
评论(0)
推荐(0)
摘要：
Tree2cycle Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 2174 Accepted Submission(s): 516 Pr 阅读全文
posted @ 2016-08-30 14:05
stort
阅读(181)
评论(0)
推荐(0)
摘要：
Coloring Trees time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ZS the Coder and Chris th 阅读全文
posted @ 2016-08-30 11:17
stort
阅读(280)
评论(0)
推荐(0)
摘要：
B. Chris and Magic Square time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output ZS the Coder a 阅读全文
posted @ 2016-08-30 07:37
stort
阅读(225)
评论(0)
推荐(0)
浙公网安备 33010602011771号