小白求助，求质数程序死循环

for i in range(1,10000):
for n in range(1, (i - 1)):
if ( (i % n) != 0):
print i

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
def hasPrime(n):
for i in range(2,n+1):
if isPrime(i):
print i
hasPrime(1000)

int n ,i;
n=0;

for(n=100;99<n<201;n++)
    {
        for(i=1;i<=n;i++)
        if(n%i==0)break;
        if(i>n-1)printf("%d\n",n);
}
return 0;

亲，这要求用python