摘要:
Codeforces Round 117 (Div. 2) 代码 "Codeforces Round 117 (Div. 2)" ) A. Battlefield any trench in meters numerically does not exceed b. 这个条件意味着每次都是在蓄能开始 阅读全文
摘要:
VK Cup 2012 Round 3 (Unofficial Div. 2 Edition) 代码 "VK Cup 2012 Round 3 (Unofficial Div. 2 Edition)" ) A. Problem About Equation 每个杯子体积$$V=\frac{b+\su 阅读全文
摘要:
Codeforces Round 116 (Div. 2, ACM ICPC Rules) 代码 "Codeforces Round 116 (Div. 2, ACM ICPC Rules)" ) A. Defragmentation 按颜色分配$1$到$\sum_{i=1}^{m}{n_i}$位置 阅读全文
摘要:
Codeforces Round 114 (Div. 2) 代码 "Codeforces Round 114 (Div. 2)" ) C. Wizards and Trolleybuses 思路 每条车的到达时间不会小于前一辆车,计算两者时间取最大值。 D. Wizards and Huge Pri 阅读全文