[Project Euler Problem 7]10001st prime

def isprime(x):
    r = int(sqrt(x))
    if x%2 == 0:
        return 0
    for i in range(3, r+1, 2):
        if x%i == 0:
            return 0
    return 1

rst = 0
x = 3
i = 1
while i<10001:
    if isprime(x):
        i += 1
        rst = x
    x += 2
print rst

problem 3에서 만든 isprime함수 재활용