Submission

Score: 100

User: mungkyskibidi

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.531 second

Submitted On: 2026-05-16 13:45:32

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

bool a[70000005];

int main(){
	int l , u , counttwin=0 , countcousin=0, countsexy=0 ;
	cin >> l >> u;
	a[1] = true;
	
	for(int i=2;i<=70000005;i++){
		if(a[i] == false){
			for(int j=2*i;j<=70000005;j+=i) a[j] = true;
		}
		if(a[i] == true) continue;
	}
	
	for(int i=l;i<=u;i++){
		
		if((a[i] == false && a[i+2] == false) || (i-2>=0 && (a[i] == false && a[i-2] == false))) counttwin++;
		if((a[i] == false && a[i+4] == false) || (i-4>=0 && (a[i] == false && a[i-4] == false))) countcousin++;
		if((a[i] == false && a[i+6] == false) || (i-6>=0 && (a[i] == false && a[i-6] == false))) countsexy++;
	}
	cout << counttwin << "\n" << countcousin << "\n" << countsexy;
}