Submission

Score: 70

User: chayuth20

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 1.096 second

Submitted On: 2026-10-12 14:30:26

#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <vector>
#include <string>
#include <iomanip>
#include <bitset>

using namespace std;
bool isprime(int num){
    if(num <= 1) return false;
    if(num <= 3) return true;
    if(num%2 == 0 or num%3 == 0) return false;
    for(int i = 5; i <= sqrt(num); i+= 6){
        if(num%i == 0 or num%(i+2) == 0) return false;
    }
    return true;
}



int main() {
    int int_twin = 0, int_cousin = 0, int_sexy = 0;
    int num11, num22;
    cin >> num11 >> num22;
    for (int p = num11; p <= num22; p++) {
                if (isprime(p)) {
                   
                    if ((p - 2 >= 2 && isprime(p-2)) || isprime(p+2)) {
                        int_twin++;
                    }
                
                    if ((p - 4 >= 2 && isprime(p-4)) || isprime(p+4)) {
                        int_cousin++;
                    }
                   
                    if ((p - 6 >= 2 && isprime(p-6)) || isprime(p+6)) {
                        int_sexy++;
                    }
                }
            }
    cout << int_twin << endl;
    cout << int_cousin << endl;
    cout << int_sexy << endl;

    
    
    
    
    return 0;
}