Submission

Score: 0

User: boss

Problemset: Twin, Cousin, and Sexy Prime

Language: cpp

Time: 0.104 second

Submitted On: 2025-10-02 20:39:11

#include <bits/stdc++.h>
using namespace std;
bool prime[10000005];//false =prime
int main()
{
	int n;
	cin>>n;
	int m[n];
	for(int i=0;i<n;i++)
	{
		cin>>m[i];
	}
	for(int i=2;i<10000005;i++)
	{
		for(int j=2;j*i<10000005;j++)
		{
			if(prime[i]==false)
			{
				prime[i*j]=true;
			
			}	
		}
	}	
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<10000005;j++)
		{
			if(prime[m[i]+j]==false)//prime
			{
				if(prime[m[i]+j+2]==false)
				{
					cout<<m[i]+j<<" "<<m[i]+j+2<<endl;
					break;
				}
			}
		}
	}
	
	return 0;
}