2012 年 11月 3 日随笔档案 - 可笑痴狂

2012年11月3日

摘要： Halloween treatsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 4979Accepted: 1876Special JudgeDescriptionEvery 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 阅读全文

posted @ 2012-11-03 22:50 可笑痴狂阅读(457) 评论(0) 推荐(0)

POJ-2356 Find a multiple ----抽屉原理

摘要： Find a multipleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4228Accepted: 1850Special JudgeDescriptionThe 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 happ 阅读全文

posted @ 2012-11-03 16:08 可笑痴狂阅读(892) 评论(0) 推荐(1)