Submission

Score: 0

User: santanaja07

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.033 second

Submitted On: 2025-09-26 22:00:48

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

int main() {
	int a,b;
	cin>>a>>b;
	int box[b-a+7]={0};
	bool prime=true;
	for(int i=a;i<=b+6;i++){
		prime=true;
		for(int j=2;j<i;j++){
			if(i%j==0){
				prime=false;
			}
		}
		if(prime){
			box[i-a]=i;
		}
	}
	int twin[b-a+7],couple[b-a+7],sexy[b-a+7];
	for(int i=0;i<b-a+7;i++){
		twin[i]=0;
		couple[i]=0;
		sexy[i]=0;
	}
	for(int i=0;i<b-a+7;i++){
		for(int j=i+1;j<b-a+7;j++){
			if(box[j]-box[i]==2){
				twin[i]++;
				twin[j]++;
			}
			if(box[j]-box[i]==4){
				couple[i]++;
				couple[j]++;
				
			}
			if(box[j]-box[i]==6){
				sexy[i]++;
				if(j<=b){
					sexy[j]++;
				}
			}
		}
	}
	int sumtwin=0;
	int sumcouple=0;
	int sumsexy=0;
	for(int i=0;i<b-a+1;i++){

		if(twin[i]!=0){
			sumtwin++;
		}
		if(couple[i]!=0){
			sumcouple++;
		}
		if(sexy[i]!=0){
			sumsexy++;
		}
	}
	cout<<sumtwin<<"\n"<<sumcouple<<"\n"<<sumsexy;
	
}