import math
def tell_prime_number(number):
if number > 1:
for i in range(2, int(math.sqrt(number)+1)):
if (number % i) == 0:
return False
else:
return True
num = int(input())
count = 0
for i in range(2,num+1):
if tell_prime_number(i) and tell_prime_number(i+2) and i+2<=num :
count=count+1
print (count)
结果超时了。
最后借鉴大牛博客,最后得以解决,尊重原创,所以这里将大牛代码贴在下面,供诸君学习:
1007素数对猜想优化