摘要: 给出要筛数值的范围n,找出以内的素数。先用2去筛,即把2留下,把2的倍数剔除掉;再用下一個質數,也就是3筛,把3留下,把3的倍数剔除掉;接下去用下一個質數5筛,把5留下,把5的倍数剔除掉;不斷重複下去......。 步驟[编辑] 详细列出算法如下: 2 3 4 5 6 7 8 9 10 11 12 阅读全文
posted @ 2015-05-26 23:51 Decouple 阅读(496) 评论(0) 推荐(0)
摘要: Soldier and Cards time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Two bored soldiers are 阅读全文
posted @ 2015-05-26 23:10 Decouple 阅读(329) 评论(0) 推荐(0)
摘要: Soldier and Badges time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Colonel has n badges. 阅读全文
posted @ 2015-05-26 23:06 Decouple 阅读(236) 评论(0) 推荐(0)
摘要: Is It A Tree? Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 24237 Accepted: 8311 Description A tree is a well-known data structure that i 阅读全文
posted @ 2015-05-26 13:27 Decouple 阅读(288) 评论(0) 推荐(0)
摘要: 小希的迷宫 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1272 Appoint description: hanjiangtao (2014-11-0 阅读全文
posted @ 2015-05-26 13:21 Decouple 阅读(190) 评论(0) 推荐(0)