搜索资源列表
proot
- 求原跟的VC程序,可计算2-10000之间的质数的原跟-original request with the VC process, translate between 2-10000 the quality of the original with a few
pi(x)
- 用Meisell-Lehmer算法计算PI(x)，即计算在小于x范围内的质数个数
Calculate-prime-number-less-than-100
- 计算100以内的质数 计算100以内的质数 -Calculate prime number less than 100
creatchildprocess
- 计算某个数字上限内的所有质数,数字限于正整数-calculate all prime numbers smaller than input number
zhishu
- 数学程序——质数自动排定及非质数计算出其因子-Math program- scheduled and non-prime auto-calculate its prime factors
leetcode
- 计算n以内的质数个数。（由于文件小于1kb，禁止上传，所以就复制了几个副本） 采用欧拉算法，运行速度极快，100000000以内的数字，只要几毫秒就可得出结果-Calculate the number of quality within the number n. (Because the file is less than 1kb, prohibit the uploading, so I copied several copies) Euler algorithm, run fast,