Submission

Score: 70

User: hmmm

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 1.072 second

Submitted On: 2025-07-25 12:01:49

#include<bits/stdc++.h>
using namespace std;
const int N=7e7+10;
bool prime[N];
int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
	int s,e,a=0,ct=0,ans[3]={};
	bool p;
	cin>>s>>e;
	for(int i=3;i<=e+6;i++)
	{
		p=true;
		for(int j=2;j<=sqrt(i);j++)
		{
			if(i%j==0)
			{
				p=false;
				break;
			}
			
		}
		if(p==true)
		{
			prime[i]=1;	
			a++;
			ct++;

		}
	}
	for(int i=s;i<=e;i++)
	{
		if(prime[i]==1)
		{
			if(prime[i+2]==1) ans[0]++;
			else if(prime[i-2]==1&&i>2) ans[0]++;
			
			if(prime[i+4]==1) ans[1]++;
			else if(prime[i-4]==1&&i>4) ans[1]++;
			
			if(prime[i+6]==1) ans[2]++;
			else if(prime[i-6]==1&&i>6) ans[2]++;
		}
	}
	cout<<ans[0]<<endl;
	cout<<ans[1]<<endl;
	cout<<ans[2]<<endl;
	
}