37,719
社区成员
发帖
与我相关
我的任务
分享
import math
def isprime(num):
for i in range(2,int(math.sqrt(num)) + 1):
if num % i == 0:
return False
return True
num = int(input())
s = 0
for iii in range(1,num + 1):
num_1 = iii
bit = 0
b = []
sum_1 = []
while num_1 != 0:
b.append(num_1 % 10)
num_1 = num_1 // 10
bit += 1
for ii in range(0,bit):
sum_1.append(str(b[bit - ii - 1] * 10 * 10 * 10 + b[bit - ii - 2] * 10 * 10 + b[bit - ii - 3] * 10 + b[bit - ii - 4]))
sum_2 = sum(filter(isprime,sum_1))
if len(sum_2) == bit:
s = s + 1
print(s)