Brilliant numbers: Difference between revisions

<lang cpp>#include <algorithm>

#include <chrono>

#include <iomanip>

#include <iostream>

const auto& primes = primes_by_digits[p / 2];

size_t position = count + 1;

uint64_t min_product = 0;

for (auto i = primes.begin(); i != primes.end(); ++i) {

min_product = product;

position += std::distance(i, j);

}

}

std::cout << "First brilliant number >= 10^" << p << " is "

First brilliant number >= 10^15 is 1,000,000,000,000,003 at position 2,601,913,448,897

 

</pre>