第1关 回文素数
def isprime(n):for j in range(2, int(n**(1/2)) + 1):if n % j == 0:return 0return 1def plalindrome_prime(n):n1 = n[::-1]if n1 == n:return 1return 0x = int(input())
i = 0
n = 2
while (i < x):if (isprime(n) and plalindrome_prime(str(n))):print(n, end=' ')i += 1n += 1第2关 反素数
def is_prime(n):for i in range(2,int(n**(1/2)+1)+1):if n % i ==0:return Falsereturn True
def reverse_prime(n):if is_prime(n) and is_prime(int(str(n)[::-1])) and str(n) !=str(n)[::-1]:return Trueelse:return False
a = int(input())
times = 0
n = 2
while times < a:if reverse_prime(n):print(n,end = " ")times += 1n +=1第3关 哥德巴赫猜想
def is_prime(n):"""判断素数的函数,接收一个正整数为参数，参数是素数时返回True，否则返回False"""# ====================Begin===================================# 补充你的代码if n < 2:return Falseelif n == 2:return Trueelse:a = int(n ** (1 / 2) + 1)for i in range(2, a + 1):if n % i == 0:return Falseelse:
