Repunit primes: Difference between revisions
Content added Content deleted
(Added C++ solution) |
m (Minor edit to C++ code) |
||
Line 60: | Line 60: | ||
#include <primesieve.hpp> |
#include <primesieve.hpp> |
||
std::vector<uint64_t> repunit_primes(uint32_t base |
std::vector<uint64_t> repunit_primes(uint32_t base, |
||
const std::vector<uint64_t>& primes) { |
const std::vector<uint64_t>& primes) { |
||
std::vector<uint64_t> result; |
std::vector<uint64_t> result; |
||
Line 78: | Line 78: | ||
for (uint32_t base = 2; base <= 36; ++base) { |
for (uint32_t base = 2; base <= 36; ++base) { |
||
futures.push_back(std::async( |
futures.push_back(std::async( |
||
[base, &primes] { return repunit_primes(base |
[base, &primes] { return repunit_primes(base, primes); })); |
||
} |
} |
||
std::cout << "Repunit prime digits (up to " << limit << ") in:\n"; |
std::cout << "Repunit prime digits (up to " << limit << ") in:\n"; |