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.