下面的欧氏筛法程序中，两个横线处应填入的分别是 ( )
bool isPrime[MAXN + 1] = {false};
int primes[MAXP], num = 0;
void sieve() {
for (int n = 2; n <= MAXN; n++) {
if (!isPrime[n]) primes[num++] = n;
for (int i = 0; i < num && (此处1); i++) {
if (此处2)
break;
}
}
}
- A.
n * primes[i] < MAXN
n % primes[i] == 0 - B.
n * primes[i] < MAXN
primes[i] > n - C.
n * primes[i] <= MAXN
n % primes[i] == 0 - D.
n * primes[i] <= MAXN
primes[i] > n