![](https://img-blog.csdnimg.cn/20190918140053667.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
数论-鸽笼原理(抽屉原理)
数论
Stephencurry‘s csdn
这个作者很懒,什么都没留下…
展开
-
Halloween treats (POJ-3370)(抽屉原理)
Every 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 may happen that a...原创 2020-04-20 17:40:35 · 297 阅读 · 0 评论 -
Find a multiple (POJ-2356)(抽屉原理)
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 that two or...原创 2020-04-20 15:54:59 · 257 阅读 · 0 评论 -
吃糖果 (HDU-1205)(鸽笼原理(抽屉原理))
HOHO,终于从Speakless手上赢走了所有的糖果,是Gardon吃糖果时有个特殊的癖好,就是不喜欢将一样的糖果放在一起吃,喜欢先吃一种,下一次吃另一种,这样;可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完?请你写个程序帮忙计算一下。Input第一行有一个整数T,接下来T组数据,每组数据占2行,第一行是一个整数N(0<N<=1000000),第二行是...原创 2020-04-07 16:29:07 · 388 阅读 · 0 评论