Daffodil International University
Problem Link
//Please follow from main function
#include<bits/stdc++.h>
using namespace std;
#define sci(x) scanf("%d", &x)
int tprime[20000000];
void seive(){
for(int i=4; i<20000000; i+=2)tprime[i]=1;
for(int i=3; i*i<=20000000; i+=2){
if(tprime[i]==0){
for(int j=i*i; j<20000000; j+=(i+i)){
tprime[j]=1;
}
}
}
}
int twin[107130];
void twin_prime()
{
int idx=1;
for(int i = 3; i<=20000000; i++){
if(tprime[i]==0 && tprime[i+2]==0)
{
twin[idx++] = i;
}
}
}
int main()
{
seive();
twin_prime();
int n;
while(sci(n)==1)
{
pf("(%d, %d)\n",twin[n],twin[n]+2);
}
return 0;
}
0 Comments