- 博客(4)
- 收藏
- 关注
RSS订阅原创 cf 372A Counting Kangaroos is Fun
A. time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are n kangaroos with pockets. Each kangaroo has
2016-02-24 13:05:10
365
原创 cf 321B
Description Kefa wants to celebrate his first big salary by going to restaurant. However, he needs company. Kefa has n friends, each friend will agree to go to the restaurant if Kefa asks. Each
2016-02-24 13:03:43
388
原创 POJ 3273 Monthly Expense
Description Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated and recorded the exact amount of money (1 ≤ moneyi
2016-02-24 13:01:24
271
转载 604B
题意：给定一个n和一个k，满足(1 ≤ n ≤ 2·k ≤ 100 000)，然后给你n个数，按照不递减排列的，这里的k表示的是箱子的个数，你需要把这n个数装到k个箱子里面，一个箱子最多装两个数，这两个数的和就是箱子的容量。最后求箱子的最小容量时多少。 这个题有点坑，首先我们要考虑一下k>n的情况哈，那么就是n个数的最后一个数就是箱子的容量。 然后注意： 我们是不是想把小的尽量和小的组合放在
2016-02-24 12:59:47
359
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人