from math import sqrt
m,n = input().split()
m = int(m)
n = int(n)
print("{}到{}之间的素数有:".format(m,n))
count = 0
def is_prime(num):
for rea in range(2,int(sqrt(num)+1)):
if num%rea==0:
return False
return True if num !=1 else False
def is_palindrome(num):
temp=num
total=0
while temp>0:
total=total * 10+temp % 10
temp//=10
return num==total
for i in range(m, n + 1):
if is_palindrome(i) and is_prime(i):
print('%d是回文素数' % i)
count += 1
print('回文素数数量:%d'%count)
运行:
100 150
100到150之间的素数有:
101是回文素数
131是回文素数
回文素数数量:2