Submission

Score: 40

User: jackpapho

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 1.084 second

Submitted On: 2026-10-08 12:10:05

#include <bits/stdc++.h>
using namespace std;
vector<int> arr;
set<int> twin,cousin,sexy;

int main(){
	int n,m,sum = 0;
	
	
	cin >> n >> m;
	for (int i = 3;i <= m+6;i++){
		bool check = true;
		for (int j = 2;j <= sqrt(i);j++){
			if (i % j == 0) check = false;
		}
		if (check) {
			arr.push_back(i);
			if (i > m) sum++;
		}
	}
	for (int i = 0;i < arr.size() - sum;i++){
		int t = arr[i]+2;
		int c = arr[i]+4;
		int s = arr[i]+6;
		for (int j = i+1;j < arr.size();j++){
			if (t == arr[j]) {
				if (n <= arr[i]&&arr[i] <= m) {
					twin.insert(arr[i]);
				}
				if (n <= arr[j]&&arr[j] <= m){
					twin.insert(arr[j]);
				} 
			}
			if (c == arr[j]) {
				if (n <= arr[i]&&arr[i] <= m) {
					cousin.insert(arr[i]);
				}
				if (n <= arr[j]&&arr[j] <= m){
					cousin.insert(arr[j]);
				} 
			}
			if (s == arr[j]) {
				if (n <= arr[i]&&arr[i] <= m){
					sexy.insert(arr[i]);
				} 
				if (n <= arr[j]&&arr[j] <= m){
					sexy.insert(arr[j]);
				}

			}
		}
	}
	cout << twin.size() << '\n' << cousin.size() << '\n' << sexy.size();
	return 0;
}