Submission

Score: 0

User: Sense.exe

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.005 second

Submitted On: 2026-09-26 13:43:21

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

int main() {
    int l,u;
    map<int,int> ct,cc,cs;
    vector<int> v;
    cin >> l >> u;
    for(int i=l; i<u; i++) {
        bool is_prime = true;
        for(int j=2; j<sqrt(i); j++) {
            if(i%j==0) {
                is_prime = false;
            }
        }
        if(is_prime) {
            v.push_back(i);
        }
    }
    for(int i=0; i<v.size(); i++) {
        for(int j=i+1; j<v.size(); j++) {
            if(abs(v[i]-v[j])==2) {
                ct[v[i]]+=1;
                ct[v[j]]+=1;
            }
            else if(abs(v[i]-v[j])==4) {
                cc[v[i]]+=1;
                cc[v[j]]+=1;
            }
            else if(abs(v[i]-v[j])==6) {
                cs[v[i]]+=1;
                cs[v[j]]+=1;
            }
        }
    }
    cout << ct.size() << "\n" << cc.size() << "\n" << cs.size();
}