PAT B1007 素数对猜想

#include <cstdio>

int main(void){
	int n;
	scanf("%d", &n);
	n++; //不超过n 
	
	int prime[n];
	int prime_num = 0;
	bool judge[n] = {0};
	
	judge[1] = true;
	for(int i = 2; i<n; i++){
		if(judge[i] == false){
			prime[prime_num] = i;
			prime_num ++;
			for(int j = i * 2; j < n; j += i){
				judge[j] = true;
			}
		} 
	}
	
	int cnt = 0;
	for(int i = 1; i < prime_num; i++){
		if(prime[i] - prime[i - 1] == 2){
			cnt ++;
		}
	}
	
	printf("%d", cnt);
	
	return 0;
}