Submission

Score: 0

User: UNJE0o

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-15 22:12:22

#include <bits/stdc++.h>
#include <iostream>
#define en '\n'
using namespace std;
typedef long long ll;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    
    int l,u;
    set<int>t ,f ,s ;
    cin >> l >> u;
    for(int i = l;i <= u;i++){
        bool c = true;
        if(i != 2 && i % 2 == 0) c = false;
        if(c == true)for(int j = 3;j <= ceil((float)(sqrt(i)));j+= 2){
            if(i % j == 0){
                c = false;
                break;
            }
        }

        // if(c == true) cout << i << " ";

        if(c == true)for(int p = 2;p <= 6;p+=2){
            if(i+p > u) break   ;

            bool o = true;

            if((i+p) % 2 == 0) continue;;
            if(o == true)for(int j = 3;j <= ceil((float)(sqrt(i+p)));j+= 2){
                if((i+p)% j == 0){
                    o = false;
                    break;
                }
            }

            if(o == true){
                if(p == 2) {
                    t.insert(i);
                    t.insert(i+2);
                    cout << i << " " << i+2 << en;
                }
                if(p == 4) {
                    f.insert(i);
                    f.insert(i+4);
                    cout << i << " " << i+4 << en;
                }
                if(p == 6) {
                    s.insert(i);
                    s.insert(i+6);
                    cout << i << " " << i+6 << en;
                }
            }
        }   
    }
    cout << t.size() << en << f.size() << en << s.size();
}