Submission

Score: 70

User: un8qe_x3

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 1.097 second

Submitted On: 2025-11-05 22:54:44

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

bool prime(int n) {
    if (n <= 1) return false;
    if (n == 2) return true;
    if (n % 2 == 0) return false;
    for (int i = 3; i * i <= n; i += 2) {
        if (n % i == 0) return false;
    }
    return true;
}

int main() {
    int a, b;
    cin >> a >> b;
    int tw = 0, co = 0, xx = 0;
    for (int i = a; i <= b; i++) {
        if (!prime(i)) continue;
        if (prime(i - 2) || prime(i + 2)) tw++;
        if (prime(i - 4) || prime(i + 4)) co++;
        if (prime(i - 6) || prime(i + 6)) xx++;
    }
    cout << tw << "\n" << co << "\n" << xx << endl;
    return 0;
}