void prime_sieve() { for ( int i = 3; i <= SQRP; i += 2 ) if ( !IsComp(i) ) for ( int j = i*i; j <= MAXP; j+=i+i ) SetComp(j); primes.reserve ( 65536 ); primes.push_back ( 2 ); for ( int i = 3; i <= MAXP; i += 2 ) if ( !IsComp(i) ) primes.push_back ( i ); }