素数
鸭脖yb
这个作者很懒,什么都没留下…
展开
-
埃氏筛
Write a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divi...原创 2018-03-31 14:00:49 · 238 阅读 · 0 评论 -
素数的两种筛子比较——埃氏筛,欧拉筛(线性筛)
埃氏筛的思想算法如下: 要得到自然数n以内的全部素数,必须把不大于 的所有素数的倍数剔除,剩下的就是素数。 给出要筛数值的范围n,找出以内的素数。先用2去筛,即把2留下,把2的倍数剔除掉;再用下一个质数,也就是3筛,把3留下,把3的倍数剔除掉;接下去用下一个质数5筛,把5留下,把5的倍数剔除掉;不断重复下去......。 时间复杂度为O(n*lglgn); void Prime() {...原创 2018-08-06 19:42:53 · 1527 阅读 · 0 评论 -
反素数——zoj 2562 More Divisors
More Divisors Everybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say that it is so because men have ten fingers....原创 2018-08-07 17:29:20 · 146 阅读 · 0 评论 -
hdu 5750 数论
Dertouzos A positive proper divisor is a positive divisor of a number nn, excluding nn itself. For example, 1, 2, and 3 are positive proper divisors...原创 2018-08-19 20:25:28 · 393 阅读 · 1 评论