Submission

Score: 0

User: SayRo

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-12 09:06:21

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

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

int main(){
    int l,u,twin=0,cousin=0,sexy=0;
    cin>>l>>u;
    prime.resize(u+1,true);
    solve(l,u);
    for(int i=0;i<p.size()-1;i++){
        for(int j=i+1;j<p.size();j++){
            if(abs(p[i]-p[j])==2) twin++;
            else if(abs(p[i]-p[j])==4) cousin++;
            else if(abs(p[i]-p[j])==6) sexy++;
        }
    }
    cout<<twin<<"\n"<<cousin<<"\n"<<sexy;
}