projecteuler---->problem=7----10001st prime
来源:互联网 发布:青岛seo是什么 编辑:程序博客网 时间:2024/05/22 17:34
title:
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10 001st prime number?
通过列出前6个质数,我们可知第6个质数是13。
那么第10001个质数是多少呢?
解答:
import math# 试除法def isOk(a):for i in range(2,int(math.sqrt(a))+1):if a%i == 0:return Falsereturn Truen=0i=2while n<10001:if isOk(i) :n+=1i += 1print i-1
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
- projecteuler---->problem=3----Largest prime factor
- Problem 7 10001st prime (线性筛)
- PE 7 10001st prime
- ProjectEuler-Problem 3-Largest prime factor
- https://projecteuler.net/problem=7
- 7 10001st prime - Project Euler
- project euler 7 10001st prime
- http://projecteuler.net/problem=7 【求第10001个素数】
- http://projecteuler.net/problem=7 [Answer:104743]
- Problem 7 of What is the 10 001st prime number?
- 欧拉计划(7)10001st prime
- struts2回顾之一:ModelDriven机制中的refreshModelBeforeResult属性
- ClippingNode裁切节点
- 将ffmpeg移植到Android
- 努力+运气。。。。
- QT多线程
- projecteuler---->problem=7----10001st prime
- Urllib.request用法简单介绍(Python3.3)
- SQL 中 where 1=1 和 1=0的 作用
- oj学生类
- pythonchallenge level6--python2.7
- 如藕片32藕片【1】 哦irewo瑞文去餓
- Java复习第四天---IO流
- WPF学习笔记——为BUTTON添加背景图片
- Base: ACID外的另外一种选择