Sexy primes: Difference between revisions
m
Minor edit to C++ code
(Use boost::circular_buffer) |
m (Minor edit to C++ code) |
||
Line 343:
vector<int> group;
group.push_back(p);
int next_p = p +
if (next_p >= max || !sieve.is_prime(next_p))
break;
group.push_back(next_p);
groups[group_size++].push_back(group);
}
▲ ++group_count[i];
}
// skip to next prime number
| |||