Submission

Score: 40

User: angpangSK

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 1.094 second

Submitted On: 2025-09-26 09:04:38

#include <bits/stdc++.h>
using namespace std;

int CheckPrime(long long n) {
    if (n < 2) return 0;
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i == 0) return 0;
    }
    return 1;
}

int CheckTwinPrime(long long n) {
    if (CheckPrime(n) && CheckPrime(n + 2)) return 1;
    if (CheckPrime(n) && CheckPrime(n - 2)) return 1;
    return 0;
}

int CheckCousinPrime(long long n) {
    if (CheckPrime(n) && CheckPrime(n + 4)) return 1;
    if (CheckPrime(n) && CheckPrime(n - 4)) return 1;
    return 0;
}

int CheckSexyPrime(long long n) {
    if (CheckPrime(n) && CheckPrime(n + 6)) return 1;
    if (CheckPrime(n) && CheckPrime(n - 6)) return 1;
    return 0;
}


int main() {
    long long n,m;
    cin>>n>>m;
    long long twinprime = 0;
    long long cousinprime = 0;
    long long sexyprime = 0;
    for (long long i = n; i <= m; i++) {
        if (CheckTwinPrime(i)) twinprime++;
        if (CheckCousinPrime(i)) cousinprime++;
        if (CheckSexyPrime(i)) sexyprime++;
    }
    cout << twinprime << endl;
    cout << cousinprime << endl;
    cout << sexyprime;
    return 0;
}