Problem 7 10001st prime

最新推荐文章于 2020-09-16 14:27:40 发布

董一峰

最新推荐文章于 2020-09-16 14:27:40 发布

阅读量284

点赞数

分类专栏： project euler 文章标签： project euler

本文链接：https://blog.csdn.net/junxinsiwo/article/details/75302079

版权

project euler 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

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?

第一版

def is_prime(n):
        if n < 2:return False
        for i in range(2,int(math.sqrt(n))+1,1):
                if not n % i:return False
        return True

def run(n):
        p = 1
        i = 0
        while i < n:
                p += 1
                if is_prime(p):
                        i += 1
        return p