import math
defprime(n):for i inrange(2,int(math.sqrt(n))+1):if n % i ==0:returnFalsereturnTrue
n =int(input())list=[]for i inrange(3, n+1,2):if prime(i):list.append(i)
s =0for i inrange(len(list)-1):iflist[i+1]-list[i]==2:
s +=1print(s)
自测-2 素数对猜想 (20 分)import mathdef prime(n): for i in range(2, int(math.sqrt(n))+1): if n % i == 0: return False return Truen = int(input())list = []for i in range(3, ...