Submission
Status:
(PPPP)(PPP)(xSS)
Subtask/Task Score:
{40/40}{30/30}{0/30}
Score: 70
User: bananakung
Problemset: Twin, Cousin, and Sexy Prime
Language: cpp
Time: 0.012 second
Submitted On: 2025-07-24 22:03:28
#include<bits/stdc++.h>
using namespace std;
int prime[7000000];
int main()
{
int s,e,a=0,ct=0,ans[3]={};
bool p;
cin>>s>>e;
for(int i=2;i<=e+6;i++)
{
if(prime[i]==0)
{
prime[i]=1;
for(int j=i*2;j<=e+6;j+=i)
{
prime[j]=2;
}
}
}
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;
}