Submission

Score: 100

User: meme_boi2

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.454 second

Submitted On: 2025-10-02 11:35:25

#include <bits/stdc++.h>
using namespace std;
int twin,cous,sexy,l,r;
int main() {
    cin>>l>>r;
    vector<bool> prime(r+10,0);
        int maxn=r+6;
    prime[1]=1;
    prime[0] = 1;
    for(int i=2;i<=maxn;i++){
        if(!prime[i]){
            for(int j=i*2;j<=maxn;j+=i){
                prime[j]=1;
            }
        }
    }
    for(int i=l;i<=r;i++){
        if(!prime[i]&&(!prime[i-2]||!prime[i+2])){
            twin++;
        }
        if(!prime[i]&&((i-4>=0&&!prime[i-4])||!prime[i+4])){
            cous++;
        }
        if(!prime[i]&&((i-6>=0&&!prime[i-6])||!prime[i+6])){
            sexy++;
        }
    }

    cout<<twin<<"\n"<<cous<<"\n"<<sexy;
}