Submission
Status:
(PPP-)(SSS)(SSS)
Subtask/Task Score:
{0/40}{0/30}{0/30}
Score: 0
User: bananakung
Problemset: Twin, Cousin, and Sexy Prime
Language: cpp
Time: 0.002 second
Submitted On: 2025-09-04 20:18:57
#include<bits/stdc++.h>
using namespace std;
bool prime[70000010];
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]=0;
for(int j=i*2;j<=e+6;j+=i)
{
prime[j]=1;
}
}
}
for(int i=s;i<=e;i++)
{
if(prime[i]==0)
{
if(prime[i+2]==0) ans[0]++;
else if(prime[i-2]==0&&i>2) ans[0]++;
if(prime[i+4]==0) ans[1]++;
else if(prime[i-4]==0&&i>4) ans[1]++;
if(prime[i+6]==0) ans[2]++;
else if(prime[i-6]==0&&i>6) ans[2]++;
}
}
cout<<ans[0]<<endl;
cout<<ans[1]<<endl;
cout<<ans[2]<<endl;
}