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.
I have to say this version is much less interesting than the original one. At least in the original problem we could find the bound of N and play with multichoose to reduce the search space, and if you don't think carefully there would be a trap where 0! == 1!. For this version there is hardly any insight with straightforward brute force.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #34: Digit factorials
You are viewing a single comment's thread. Return to all comments →
I have to say this version is much less interesting than the original one. At least in the original problem we could find the bound of N and play with multichoose to reduce the search space, and if you don't think carefully there would be a trap where 0! == 1!. For this version there is hardly any insight with straightforward brute force.