代码实现:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
int isPrime(int num)
{
if (num <= 1)return 0;
for (int i = 2; i <= sqrt(num); i++)
if (num%i == 0)return 0;
return 1;
}
int main()
{
int N, cnt = 0;
scanf("%d", &N);
for (int i = 2; i <= N; i++)
if (isPrime(i) == 1 && isPrime(i - 2) == 1)cnt++;
printf("%d", cnt);
return 0;
}