Sexy primes: Difference between revisions

m
Minor edit to C++ code
m (Minor edit to Rust code)
m (Minor edit to C++ code)
Line 310:
#include <vector>
#include <boost/circular_buffer.hpp>
#include "../library/sieve_of_eratosthenes.h"
 
int main() {
Line 333:
circular_buffer<int> unsexy_primes(max_unsexy);
 
for (int p = 2; p < max; ++p) {
whileif (p < max && !sieve.is_prime(p))
++pcontinue;
if (!sieve.is_prime(p + diff) && (p - diff < 2 || !sieve.is_prime(p - diff))) {
// if p + diff and p - diff aren't prime then p can't be sexy
Line 351 ⟶ 353:
}
}
// skip to next prime number
++p;
while (p < max && !sieve.is_prime(p))
++p;
}
 
1,777

edits