为什么打不出来呢？想打印100个反素数

def judge(n):
if n>1:
for i in range(1,n):
if n%i==0:
return True
else:
return False
sum=1
for n in range(1,10000):
m=int(str(n)[::-1])
if judge(m)==False and n<m:
print(n)
sum+=1
if sum==100:
break

def judge(n):
    for i in range(2,n):
        if n%i != 0:
            return False
    return True
sum=1
for n in range(1,10000):
m=int(str(n)[::-1])
if judge(m)==False and n<m:
print(n)
sum+=1
if sum==100:
break

我改了改你的代码

def is_primes(number):
    n = 0
    for i in range(2, int(number / 2) + 1):
        if number % i == 0:
            n += 1

    if n == 0:
        return True
    else:
        return False


def not_palindrome(number):
    number_list = []
    number_repeat = number
    while True:
        number_list.append(number_repeat % 10)
        if number_repeat / 10 < 1:
            break
        else:
            number_repeat = number_repeat // 10
    reverse = 0
    n = 1
    for i in number_list[::-1]:
        reverse += i * n
        n = n * 10
    if reverse == number:
        return False
    else:
        return True

if __name__ == '__main__':
    NUMBER_LIMITED = 100
    n = 0
    i = 1
    while n < NUMBER_LIMITED:
        if is_primes(i) and not_palindrome(i):
            print(format(i, "3"), end="   ")
            n += 1
            i += 1
            if n % 10 == 0:
                print()
        else:
            i += 1
            continue