We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
My program finds 13!'s divisors 66528 and 93600 (among others) because their successor is a prime and combines them.
Sorting those roughly 180000 numbers finishes almost instantly but I went the crazy way and preferred ''std::nth_element'' because it is a little bit more efficient - but you can't measure the performance advantage
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #248: Numbers for which Euler’s totient function equals 13!
You are viewing a single comment's thread. Return to all comments →
My program finds 13!'s divisors 66528 and 93600 (among others) because their successor is a prime and combines them. Sorting those roughly 180000 numbers finishes almost instantly but I went the crazy way and preferred ''std::nth_element'' because it is a little bit more efficient - but you can't measure the performance advantage