Sequence of primorial primes: Difference between revisions

Content added Content deleted
(No need to use a prime sieve in C++ code)
m (Minor edit to C++ code)
Line 124: Line 124:


int main() {
int main() {
const size_t max = 20;
const unsigned int max = 20;
integer primorial = 1;
integer primorial = 1;
for (size_t p = 0, count = 0, index = 0; count < max; ++p) {
for (unsigned int p = 0, count = 0, index = 0; count < max; ++p) {
if (!is_prime(p))
if (!is_prime(p))
continue;
continue;