摘要：
FATE Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11420 Accepted Submission(s): 5407 Problem D 阅读全文
摘要：
Coins Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14145 Accepted Submission(s): 5635 Problem 阅读全文
摘要：
01 背包 有n 种不同的物品，每个物品有两个属性，size 体积，value 价值，每种物品只有一个，现在给一个容量为 w 的背包，问最多可带走多少价值的物品。 完全背包 如果物品不计件数，就是每个物品有无数件的话，稍微改下即可 多重背包既是每个物体有一定的重量w和价值v，并且有一定的数量cnt, 阅读全文
摘要：
最大报销额 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24530 Accepted Submission(s): 7508 Problem 阅读全文
摘要：
Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23142 Accepted Submission(s): 8531 Prob 阅读全文
摘要：
B. Working out time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Summer is coming! It's ti 阅读全文
摘要：
折线分割平面 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29965 Accepted Submission(s): 20289 Proble 阅读全文
摘要：
[a]n条直线最多分平面问题 n条直线，最多可以把平面分为多少个区域? 见K 切糕 递推关系:都将原来所有的区域分成两半，因此第n条直线会在原来的基础上再添加n个平面 f[0]=1,f[1]=2...f[n]=f[n-1]+n 推导公式f[n]=n*(n+1)/2+1 [b]a的改进 每次使用两条直 阅读全文
摘要：
超级楼梯 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58070 Accepted Submission(s): 29503 Problem 阅读全文
摘要：
一只小蜜蜂... Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 73139 Accepted Submission(s): 26257 Prob 阅读全文