Submission

Score: 0

User: nate213121

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-19 13:26:36

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int l, h;
    cin >> l >> h;
    vector<bool> isPrime(h + 7);
    isPrime[0] = false;
    isPrime[1] = false;
    vector<int> primes;
    for(int n = 2; n <= h + 6; n++)
    {
        if(isPrime[n])
        {
            for(int x = n + n; x <= h + 6; x += n)
            {
                isPrime[x] = false;
            }
        }
    }
    for(int i = 0; i < isPrime.size(); i++)
    {
        if(isPrime[i])
        {
            primes.push_back(i);
        }
    }
    set<int> two, four, six;
    for(auto& p:primes)
    {
        if(isPrime[p + 2] || isPrime[p - 2])
        {
            two.insert(p);
        }
        if(isPrime[p + 4] || isPrime[p - 4])
        {
            four.insert(p);
        }
        if(isPrime[p + 6] || isPrime[p - 6])
        {
            six.insert(p);
        }
    }
    cout << two.size() << endl << four.size() << endl << six.size();
    return 0;
}