Jump to content

Multi-base primes: Difference between revisions

m
Rust - minor edit
m (C++ performance improvement)
m (Rust - minor edit)
Line 1,442:
 
fn increment(digits: &mut [usize], base: usize) -> bool {
let mut i = digits.leniter_mut().rev();
whilefor id >in 0 && digits[i - 1] + 1 == base {
digits[iif -*d + 1] != 0;base {
i - *d += 1;
return true;
}
if i == 0 {}
return*d false= 0;
}
}false
digits[i - 1] += 1;
true
}
 
Line 1,569 ⟶ 1,568:
441431 -> [5, 8, 9, 11, 12, 14, 16, 17, 19, 21, 22, 23, 26, 28, 30, 31, 32, 33]
 
elapsed time: 1478315139 milliseconds
</pre>
 
Line 1,591 ⟶ 1,590:
50161 -> [7, 8, 9, 13, 17, 18, 19, 20, 25, 28, 29, 30, 31, 33, 35, 36, 38, 39, 41, 42, 43, 44, 47, 48, 52, 55, 56, 59, 60, 62]
 
elapsed time: 95709569 milliseconds
</pre>
 
1,777

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.