ProjectEuler-Problem 7-10001st prime
来源:互联网 发布:java和asp.net的区别 编辑:程序博客网 时间:2024/05/14 10:11
# @Time : 2017/6/24 15:40# @Author : wanyang# @Mail :wanyangnumberone@gmail.com# @Question:https://projecteuler.net/problem=7# @Answer :# 初始化质数集合primelist = [2]# 筛选质数规则:常数从3开始和质数集合中的每一个数字进行取余运算,若都不能整除,则该数字为质数并添加到集合中;反正则重新开始循环primecount = 10001 # 集合的大小index = 0num = 3while index < primecount - 1: flag = True for i in primelist: if num % i == 0: flag = False break if flag: index = index + 1 primelist.append(num) print("第%d个质数:%d" % (index, num)) # 偶数过滤 num = num + 2
阅读全文
0 0
- projecteuler---->problem=7----10001st prime
- ProjectEuler-Problem 7-10001st prime
- Problem 7:10001st prime
- Problem 7 10001st prime
- 【Project Euler】【Problem 7】10001st prime
- (Problem 7)10001st prime
- Project Euler Problem 7: 10001st prime
- Problem 7 10001st prime (线性筛)
- PE 7 10001st prime
- projecteuler---->problem=3----Largest prime factor
- ProjectEuler-Problem 3-Largest prime factor
- 7 10001st prime - Project Euler
- project euler 7 10001st prime
- Problem 7 of What is the 10 001st prime number?
- 欧拉计划(7)10001st prime
- 欧拉项目第7题 10001st prime
- https://projecteuler.net/problem=7
- Project Euler 007 10001st prime
- AS上传项目到GitHub报错can't finish Github sharing precess.
- linux 使用shell脚本写数据报表并且在web端浏览
- Android初级学习总结
- Linux的vi命令
- Phantomjs 与 Chrome 的一点区别
- ProjectEuler-Problem 7-10001st prime
- Kotlin官方参考整理——04.函数和lambda表达式
- 基于Win32控制台的万年历的实现(上)
- 全面解析Linux 内核 3.10.x
- select服务器---I/O多路连接之select
- Javascript再改造(1)——数据类型和变量
- Saber电路仿真软件
- A. Karen and Morning
- win10开机后黑屏一段时间(amd显卡)