# Geeksforgeeks Solution For " The Prime Twins "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers

Problem :- The Prime Twins

Solution :-

# include <iostream>
#include<math.h>
using namespace std;
int isprime(int i)
{
int flag=1;
for(int j=2;j<=sqrt(i);j++)
{
if(i%j==0)
{
flag=0;
break;
}

}
return flag;
}

int main()
{
int  T;
cin>>T;
while(T--)
{
int min,max,t,cnt=0,f=0,a[100]={0},count=0;
cin>>min>>max;
for(int i=min;i<=max;i++)
{
if(isprime(i)==1)
{
a[count]=i;
count++;
}
}
for(int i=0;i<=count;i++)
{
if(a[i+1]-a[i]==2)
{
cout<<a[i]<<" "<<a[i+1];
f=1;
break;
}
}
if(f==0)
cout<<"-1";
cout<<endl;
}
}

Output:-

Previous Post
Next Post

#### post written by: Ghanendra Yadav

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.