蓝桥杯-小明的素数对

"""
https://www.lanqiao.cn/problems/3205/learning/?page=1&first_category_id=1&name=%E5%B0%8F%E6%98%8E%E7%9A%84%E7%B4%A0%E6%95%B0%E5%AF%B9
"""
# 埃氏筛法
def get_prime(n):
  vis = [0] * (n + 1)
  vis[0] = vis[1] = 1
  prime = []
  for i in range(n + 1):
    if vis[i] == 0:
      prime.append(i)
      for j in range(i + i, n + 1, i):
        vis[j] = 1
  return vis, prime

n = int(input())
vis, prime = get_prime(n)
res = 0
for i in range(len(prime)):
  for j in range(i + 1, len(prime)):
    if vis[prime[j] - prime[i]] == 0:
      res += 1
print(res)