Truncatable primes: Difference between revisions
m
Updated Sieve of Eratosthenes C++ code
(Added Prolog Solution) |
m (Updated Sieve of Eratosthenes C++ code) |
||
Line 591:
#define SIEVE_OF_ERATOSTHENES_H
#include <algorithm>
#include <vector>
class sieve_of_eratosthenes {
public:
explicit sieve_of_eratosthenes(size_t);
bool is_prime(size_t) const;
private:
std::vector<bool>
};
inline bool sieve_of_eratosthenes::is_prime(size_t n) const {
return
if (n < 2 || n % 2 == 0)
return odd_prime_[n/2 - 1];
}
inline sieve_of_eratosthenes::sieve_of_eratosthenes(size_t
odd_prime_.resize((limit - 1)/2, true);
size_t inc = 2 * p;
odd_prime_[q/2 - 1] = false;
▲ {
▲ for (size_t q = p * p; q < max; q +=p)
▲ is_prime_[q] = false;
}
}
| |||