Submission

Score: 0

User: SayRo

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-12 10:20:25

#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<bool> prime;

void solve(int l,int u){
    prime[0]=0;
    prime[1]=0;
    for(int i=2;i<=u+6;i++){
        if(prime[i]){
            for(int j=i*i;j<=u+6;j+=i) prime[j]=false;
        }
    }
    return;
}

int main(){
    int l,u,twin=0,cousin=0,sexy=0;
    cin>>l>>u;
    prime.resize(u+7,true);
    solve(l,u);
    for(int i=l;i<=u;i++){
        if(!prime[i]) continue;
        bool is=false,it=false,ic=false;
        if(i-2>=2&&prime[i-2]||prime[i+2]) it=true;
        if(i-4>=2&&prime[i-4]||prime[i+4]) ic=true;
        if(i-6>=2&&prime[i-6]||prime[i+6]) is=true;
        if(it) twin++;
        if(ic) cousin++;
        if(is) sexy++;
    }
    cout<<twin<<"\n"<<cousin<<"\n"<<sexy;
}