欧拉项目代码(1--7)

count=1
num=3
def findPrime(s):
    i=2
    a=s
    while i<s/2:
        if s%i == 0:
            s=s/i
            break
        else:
            i=i+1
    if s==a:
        return True
    else:
        return False

while count <10001:
    if findPrime(num):
        count =count + 1
        num = num +2
    else:
        num = num+2
print num-2