Ormiston pairs: Difference between revisions
m
C++ - simplified code
m (→{{header|Wren}}: Removed a redundant line.) |
m (C++ - simplified code) |
||
Line 117:
=={{header|C++}}==
{{libheader|Primesieve}}
<syntaxhighlight lang="cpp">#include <
#include <iomanip>
#include <iostream>
Line 123:
#include <primesieve.hpp>
for (; n > 0; n /= 10)▼
++count_[n % 10];▼
}▼
class ormiston_pair_generator {
Line 148 ⟶ 132:
auto digits = digits_;
prime_ = pi_.next_prime();
digits_ =
if (digits_ == digits)
return std::make_pair(prime, prime_);
Line 155 ⟶ 139:
private:
static std::array<int, 10> get_digits(uint64_t n) {
std::array<int, 10> result = {};
▲ for (; n > 0; n /= 10)
return result;
▲ }
primesieve::iterator pi_;
uint64_t prime_;
};
| |||