摘要: Find a multipleTime Limit:1000MSMemory Limit:65536KTotal Submissions:6965Accepted:3052Special JudgeDescriptionThe input contains N natural (i.e. posit... 阅读全文
posted @ 2015-08-21 14:10 111qqz 阅读(246) 评论(0) 推荐(0) 编辑
摘要: Halloween treatsTime Limit:2000MSMemory Limit:65536KTotal Submissions:7470Accepted:2742Special JudgeDescriptionEvery year there is the same problem at... 阅读全文
posted @ 2015-08-21 13:36 111qqz 阅读(218) 评论(0) 推荐(0) 编辑
摘要: Mountain RoadTime Limit:1000MSMemory Limit:65536KTotal Submissions:310Accepted:111DescriptionIn the Franconian Switzerland, there is a narrow mountain... 阅读全文
posted @ 2015-08-21 03:57 111qqz 阅读(206) 评论(0) 推荐(0) 编辑
摘要: 如果问题中各数据的范围明确,那么无穷大的设定不是问题,在不明确的情况下,很多程序员都取0x7fffffff作为无穷大,因为这是32-bit int的最大值。如果这个无穷大只用于一般的比较(比如求最小值时min变量的初值),那么0x7fffffff确实是一个完美的选择,但是在更多的情况下,0x7fff... 阅读全文
posted @ 2015-08-21 03:48 111qqz 阅读(97) 评论(0) 推荐(0) 编辑
摘要: Divisible SubsequencesTime Limit:1000MSMemory Limit:65536KTotal Submissions:2326Accepted:843DescriptionGiven a sequence of positive integers, count al... 阅读全文
posted @ 2015-08-21 01:11 111qqz 阅读(214) 评论(0) 推荐(0) 编辑