Submission

Score: 70

User: mumumimi

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 1.093 second

Submitted On: 2026-10-03 22:31:14

#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool isprime(ll n){
    if(n<=1) return false;
    if(n==2) return true;
    if(n%2==0) return false;
    for(int i=3;i<=sqrt(n);i+=2){
        if(n%i==0) return false;
    }
    return true;
}
int main(){
    int twin=0,cousin=0,sexy=0;
    int a,b;cin >> a >> b;
    for(int i=a;i<=b;i++){
        if(isprime(i)){
            if(isprime(i-2)||isprime(i+2)){
            twin++;
        }
        if(isprime(i-4)||isprime(i+4)){
            cousin++;
        }
        if(isprime(i-6)||isprime(i+6)){
            sexy++;
        }
        }
        
    }
    cout << twin << "\n" << cousin << "\n" << sexy;
}