Submission

Score: 0

User: Zailagend1

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.175 second

Submitted On: 2026-06-23 23:16:57

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<string> vs;
typedef unordered_map<int, int> umii;
typedef unordered_map<string, int> umsi;
typedef unordered_map<char, int> umci;
typedef unordered_map<ll, ll> umll;
typedef unordered_set<int> usi;

#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define sz(v) (int)(v).size()
#define il(n) int i = 0; i < (n); i++
#define jl(n) int j = 0; j < (n); j++
#define kl(n) int k = 0; k < (n); k++

const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

template<typename T> void _dbg(T t) { cerr << t; }
template<typename T, typename... Args> void _dbg(T t, Args... args) { cerr << t << ", "; _dbg(args...); }
#ifdef LOCAL
#define debug(...) do { cerr << "[" << #__VA_ARGS__ << "] = ["; _dbg(__VA_ARGS__); cerr << "]" << endl; } while(0)
#else
#define debug(...)
#endif
const int MAXN = 70000005; 
vector<bool> is_prime(MAXN, true);
int twin = 0;
int cousin = 0;
int sexy = 0;
void sieve() {
    is_prime[0] = is_prime[1] = false;
    for (int p = 2; p * p < MAXN; p++) {
        if (is_prime[p]) {
            for (int i = p * p; i < MAXN; i += p) {
                is_prime[i] = false;
            }
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    sieve();
    int a,b;
    cin >> a >> b;
    for(int i = a;i<=b;i++){
      if(is_prime[i]){
        if(i +2 <= b && is_prime[i+2] ){
          twin+=2;
        }
        if(i +4 <= b && is_prime[i+4]){
          cousin+=2;
        }
        if(i + 6 <= b && is_prime[i+6]){
          sexy+=2;
        } 
      }
      
    }
    cout << twin << '\n' << cousin << '\n' << sexy;
    
    return 0;
}