UVA 10394 - Twin Primes

/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647

ll data[19000000] ;
ll prime[19000000] ;
ll cnt =1 ;

void isPrime()
{
   ll i,j ;
    ll k = 19000000 ;
    prime[0] = prime[1] =1 ;
    for(i=3 ; i<=k ; i+=2)
    {
        if(prime[i]==0)
        {
            for(j=i*i ; j<=k ; j+=(i+i))
            {
                prime[j] =1 ;
            }
        }
        if(prime[i]==0 && prime[i-2]==0)
        {
            data[cnt++] = i-2 ;
        }
    }
}

int main()
{
    isPrime() ;
    ll n ,cnt,i,num1,num2,dis;

    while(sc("%lld",&n)==1)
    {
        pf("(%lld, %lld)\n",data[n],data[n]+2) ;
    }
    return 0;
}