Prime Number

[编程题]Prime Number

热度指数：17301 时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 64M，其他语言128M
算法知识视频讲解

Output the k-th prime number.

输入描述:

k≤10000

输出描述:

The k-th prime number.

示例1

输入

3
7

输出

5
17

算法知识视频讲解

Python

lx的流星

while True:
    try:
        n=int(input().strip())
        def isprime(n):
            result=True
            if n<=1:
                result=False
            else:
                for i in range(2,int(n**(0.5))+1):
                    if n%i==0:
                        result=False
                        break
            return result
        list1=[]
        index=2
        while len(list1)!=n:
            if isprime(index):
                list1.append(index)
            index+=1
        print(list1[-1])
    except:
        break

发表于 2019-08-08 21:03:49 回复(0)

Python

TimeMac

def isPrime(num):
    for i in range(2, int(num**0.5)+1):
        if num % i == 0:
            return False
    return True
while True:
    try:
        primeResult = [2]
        a = 1
        num = int(input())
        while len(primeResult) < num:
            a += 2
            if isPrime(a):
                primeResult.append(a)
        print(primeResult[num-1])
    except Exception:
        break

编辑于 2018-10-13 14:27:05 回复(0)

Python

华科平凡

python solution:

通过测试了

import math


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


while True:
    try:
        res = [2]
        start = 3
        n = int(input())
        while len(res) < n:
            if isPrime(start):
                res.append(start)
            start += 2

        print(res[n - 1])
    except:
        break

发表于 2017-10-16 17:57:05 回复(0)