Iterate backwards over primes using primesieve::iterator.
Iterate backwards over primes using primesieve::iterator.
#include <cstdlib>
#include <iostream>
int main(int argc, char** argv)
{
uint64_t limit = 10000000000ull;
if (argc > 1)
limit = std::atol(argv[1]);
uint64_t sum = 0;
sum += prime;
std::cout << "Sum of primes < " << limit << " = " << sum << std::endl;
if (limit > 10000000000ull)
std::cerr << "Warning: sum is likely incorrect due to 64-bit integer overflow!" << std::endl;
return 0;
}
primesieve::iterator allows to easily iterate over primes both forwards and backwards.
Definition: iterator.hpp:33
void skipto(uint64_t start, uint64_t stop_hint=get_max_stop())
Reset the primesieve iterator to start.
uint64_t prev_prime()
Get the previous prime.
Definition: iterator.hpp:79