P_Sarker Coding House

/* You have to find out two nearest prime numbers of N which have the maximum size less than or equals to N and the gap between them is two. In this code/algorithm, since the input data is subtle by 10^3, in that case, any naive formulation to find prime numbers is acceptable. Thus, we have applied Sieve to make separate all composite and prime numbers and then the Twin_Prime() function figure out the two adjacent prime numbers in such as way that each number is updated by its adjacent prime number which has a difference is two. */ #include<stdio.h> #define high 1007 #define sf scanf #define pf printf int primes[high], flag[high]; void init() {     int i=0;     for(; i<high; i++)     {         flag[i] = 0;     } } void Sieve() {     int i=0, j=0;     for(i=2; i<high; i++)     {         if(flag[i] == 0)         {             //pf("%d ", i);             for(j=i*i; j<high; j+=i)             {                 flag[j] = 1; // all composite numbers             }