Multi-base primes: Difference between revisions
m
C++ performance improvement
m (C++ performance improvement) |
m (C++ performance improvement) |
||
Line 45:
=={{header|C++}}==
{{libheader|Primesieve}}
Originally translated from [[#Wren|Wren]] with ideas borrowed from other solutions.
The maximum base and number of characters can be specified as command line arguments.
Line 55 ⟶ 56:
#include <string>
#include <vector>
#include <primesieve.hpp>
class prime_sieve {
Line 67 ⟶ 69:
};
prime_sieve::prime_sieve(uint64_t limit) : sieve((limit + 1) / 2,
primesieve::iterator iter;
uint64_t prime = iter.next_prime(); // consume 2
}
}
Line 180 ⟶ 175:
{{out}}
Maximum base 36 and maximum length 6. This takes 0.
<pre>
1-character strings which are prime in most bases: 34
Line 205 ⟶ 200:
</pre>
Maximum base 62 and maximum length 5. This takes 0.
<pre>
1-character strings which are prime in most bases: 60
| |||