Submission

Score: 100

User: kavin8888

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.322 second

Submitted On: 2025-10-16 21:52:08

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fs first
#define sc second
#define pll pair<long long int,long long int>
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int l,r; cin>>l>>r;
	//sieve
	vector<bool> prime(r+7,true);
	prime[0]=prime[1]=false;
	for(int i=2;i*i<=r+6;i++)
	{
		if(prime[i])
		{
			for(int j=i*i;j<=r+6;j+=i)
			{
				prime[j]=false;
			}
		}
	}
	//CHK T C S
	int t=0,c=0,s=0;
	int mac=r+6;
	for(int i=l;i<=r;i++)
	{
		if(!prime[i]) continue;
		if((i-2>=2 && prime[i-2]) || (i+2<=mac && prime[i+2])) t++;
		if((i-4>=2 && prime[i-4]) || (i+4<=mac && prime[i+4])) c++;
		if((i-6>=2 && prime[i-6]) || (i+6<=mac && prime[i+6])) s++;
	}
	cout<<t<<'\n'<<c<<'\n'<<s<<'\n';
}