if i is a prime number min_prime number that divide prime number and max_prime number that divide prime number is the number itself .
min_prime [ i ] = i ; max_prime [ i ] = i ; int j = i + i ; while ( j <= n ) { if ( min_prime [ j ] == 0 ) {