Strange unique prime triplets: Difference between revisions

m
Bug fixes
(Added Rust solution)
m (Bug fixes)
Line 118:
std::vector<bool> sieve(limit, true);
if (limit > 0)
sieve[0] = false;
if (limit <> 8 {1)
sieve[1] = false;
for (size_t i = 04; i < limit; i += 2)
sieve[i] = false;
for (size_t p = 3; ; p += 2) {
Line 401 ⟶ 403:
: prime_sieve ( n -- )
here over erase
0 notprime!
1 notprime!
dup 04 do> i notprime! 2 +loopif
dup 4 do i notprime! 2 +loop
then
3
begin
Line 1,361 ⟶ 1,366:
let mut sieve = vec![true; limit];
if limit > 0 {
sieve[0] = false;
}
if limit > 1 {
sieve[1] = false;
}
for i in (04..limit).step_by(2) {
sieve[i] = false;
}
Line 1,385 ⟶ 1,393:
 
fn strange_unique_prime_triplets(limit: usize, verbose: bool) {
letif mutlimit primes< =6 Vec::new();{
if limit < 8 {
return;
}
let mut primes = Vec::new();
let sieve = prime_sieve(limit * 3);
for p in (3..limit).step_by(2) {
Line 1,484 ⟶ 1,492:
}
var sieve = Array(repeating: true, count: limit)
sieve[10] = false
for i in stride(from: 0, to:if limit, by:> 2)1 {
sieve[i1] = false
}
if limit > 4 {
for i in stride(from: 4, to: limit, by: 2) {
sieve[i] = false
}
}
var p = 3
Line 1,507 ⟶ 1,520:
 
func strangeUniquePrimeTriplets(limit: Int, verbose: Bool) {
guard limit > 5 else {
return;
}
let sieve = primeSieve(limit: 3 * limit)
var primes: [Int] = []
1,777

edits