Submission

Score: 100

User: dddrrrr

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.364 second

Submitted On: 2025-10-16 17:32:26

#include <bits/stdc++.h>
using namespace std;

vector <bool> prime;
void sieve(int r){
	prime[0] = false;
	prime[1] = false;
	for(int i=2 ;i*i<=r ;i++){
		if(!prime[i])continue;
		for(int j=i*i ;j<=r ;j+=i){
			prime[j] = false;
		}
	}
	return ;
}


int main(){
	cin.tie(0)->sync_with_stdio(0);
	int l ,r;
	cin >> l >> r;
	prime.resize(r+7 ,true);
	sieve(r+7);
	
	
	int tw=0 ,cs=0 ,sex=0;
	
	for(int i=l ;i<=r ;i++){
		if(prime[i] && (prime[i+2] || prime[i-2]))tw++;
		if(prime[i] && (prime[i+4] || prime[i-4]))cs++;
		if(prime[i] && (prime[i+6] || prime[i-6]))sex++;
		
	}
		
	cout << tw << '\n' << cs << '\n' << sex;
	return 0;
	
}