#include<iostream>usingnamespacestd;
intPrime(int n){
if (n < 2)
return0;
for (int i = 2; i *i <= n; i++) {
if (n%i == 0)
return0;
}
return1;
}
intmain(){
int n;
int count = 0;
cin >> n;
for (int i = 5; i <= n; i+=2) {
if (Prime(i - 2) == 1 && Prime(i) == 1)
count++;
}
cout << count << endl;
return0;
}
python3代码
import math
defPrime(n):if (n < 2):
return0
count = int(math.sqrt(n))
for i in range(2,count+1):
if(n % i == 0):
return0return1defmain():
n = int(input())
result = 0
res = []
for i in range(3,n + 1,2):
if(Prime(i) == 1):
res.append(i)
for i in range(len(res)-1):
if(res[i+1]-res[i]==2):
result+=1
print(result)
main()