def ishuiwen(a): a=str(a) b=len(a) for i in range(b//2): if a[i] != a[b-i-1]: return False return True
for i in range(100,200): if isprime(i) and ishuiwen(i): print(i,end=' ,')
代码贴出来,不要截图