
抽屉原理
岩霏
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj 23565-Find a multiple
Find a multiple The input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not necessarily different (so it may happen原创 2017-07-30 11:24:01 · 204 阅读 · 0 评论 -
POJ 3370 Halloween treats(抽屉原理)
Halloween treatsEvery year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so it ma原创 2017-07-30 14:16:34 · 343 阅读 · 0 评论