素数筛选
Haskei
这个作者很懒,什么都没留下…
展开
-
K - Semi-prime H-numbers 筛选数
K - Semi-prime H-numbersTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThis problem is based on an exercise of David Hilbert,原创 2016-09-29 10:47:08 · 397 阅读 · 0 评论 -
素数筛选
第一种:剔除2 3 4 5 6 ... ... 的倍数在i从2开始的增一变化过程中,剔除i的倍数即j*i(j是大于等于2的自然数,j的上限是问题规模M)为了减少重复步骤,可以每当i递增到等于第一个没有被剔除的(素)数时再剔除该数的倍数,重复上述过程至i到达问题规模m的平方根+1需要说明的三个问题:假设循环到第n个数,如果该数没有被剔除,那么该数不能是前边所有数的倍数,该转载 2016-11-01 18:35:50 · 368 阅读 · 1 评论 -
H - Counterfeit Dollar
DescriptionSally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguisha原创 2016-09-29 18:28:44 · 489 阅读 · 0 评论 -
求多个数的最小公倍数
C - Least Common MultipleTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe least common multiple (LCM) of a set of positive原创 2016-09-26 20:27:51 · 694 阅读 · 0 评论