https://www.patest.cn/contests/pat-b-practise/1007
#include "stdio.h"
#include "math.h"
int main()
{
int i, j, n, temp;
int t = 0, k = 0, num[9600] = {0};
scanf("%d", &n);
for(i = 2; i <= n; ++i)
{
temp = sqrt(i);
for(j = 2; j <= temp; ++j)
if(0 == i%j)
break;
if(j > temp)
{
num[k] = i;
if((k > 0) && (2 == num[k] - num[k-1]))
++t;
++k;
}
}
printf("%d\n", t);
return 0;
}