摘要:
1.Link:http://poj.org/problem?id=22992.Content:Ultra-QuickSortTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 41876Accepted: 15208Description...
阅读全文
posted @ 2014-08-24 21:01
mobileliker
阅读(157)
推荐(0)
编辑
摘要:
1.Link:http://poj.org/problem?id=2262http://bailian.openjudge.cn/practice/22622.Content:Goldbach's ConjectureTime Limit: 1000MSMemory Limit: 65536KTot...
阅读全文
posted @ 2014-08-24 20:57
mobileliker
阅读(170)
推荐(0)
编辑
摘要:
1.Link:http://poj.org/problem?id=22552.Content:Tree RecoveryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 11448Accepted: 7186DescriptionLit...
阅读全文
posted @ 2014-08-24 20:47
mobileliker
阅读(173)
推荐(0)
编辑
摘要:
参考:http://blog.csdn.net/liukehua123/article/details/54828541.开一个大的bool型数组prime[],大小就是n+1就可以了.先把所有的下标为奇数的标为true,下标为偶数的标为false. 2.然后: for( i=3; i 2 3 #...
阅读全文
posted @ 2014-08-24 20:41
mobileliker
阅读(126)
推荐(0)
编辑
摘要:
1.Linkhttp://poj.org/problem?id=27392.ContentSum of Consecutive Prime NumbersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 19167Accepted: 1...
阅读全文
posted @ 2014-08-24 20:34
mobileliker
阅读(153)
推荐(0)
编辑
摘要:
1.链接地址:http://poj.org/problem?id=2159http://bailian.openjudge.cn/practice/21592.题目:Ancient CipherTime Limit: 1000MSMemory Limit: 65536KTotal Submissio...
阅读全文
posted @ 2014-08-24 11:11
mobileliker
阅读(246)
推荐(0)
编辑
摘要:
1.链接:http://poj.org/problem?id=32992.题目:HumidexTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 16705Accepted: 6078DescriptionAdapted from Wik...
阅读全文
posted @ 2014-08-24 11:07
mobileliker
阅读(178)
推荐(0)
编辑