1
2
3
4
5
6
7
8
9
10
11
12
13
void CalculatePrimesUpTo(int max) {
::std::fill(is_prime_, is_prime_ + is_prime_size_, true);
is_prime_[0] = is_prime_[1] = false;

for (int i = 2; i <= max; i++) {
if (!is_prime_[i]) continue;

// Marks all multiples of i (except i itself) as non-prime.
for (int j = 2*i; j <= max; j += i) {
is_prime_[j] = false;
}
}
}

Comments

2016-12-23