i = 10
HuiWenSu =[]
JieGuo = []
#筛选回文数
while i <= 1000:
ZiFu = str(i)
FanZhuan = ZiFu[::-1]
HuiWen = int(FanZhuan)
if HuiWen == i:
HuiWenSu.append(HuiWen)
i += 1
#在筛选出来的回文数中筛选符合条件的素数
for Hui in HuiWenSu:
a = 2
while a < Hui:
if Hui % a == 0:
break
elif a+1 == Hui:
JieGuo.append(Hui)
a += 1
else:
a += 1
print(JieGuo)
def is_prime(n):
for x in range(2, n):
if n%x==0:
return False
return True
def palindrome_prime(num):
for i in range(2,num):
m = int(str(i)[::-1])
if i==m and is_prime(i):
print(i)
positive_int=int(input("请输入一个正整数:"))
palindrome_prime(positive_int)
如有帮助,望采纳!谢谢!