Please give me some hint to solve this practice problem from topcoder, I tried but couldn’t come up with any nice idea. Below is the link.

Refactoring

@c0d3h4ck3d an important hint is in the last sample case. Given that the number of factorizations will never be larger than 7389115, it’s quite possible to brute-force the solution. It’s similar to *partitions*, except we’re concerned with products instead of sums. Good luck!

It’s all about concentration and presence of mind. As If you have read the question deeply then you will find that there is a limit of factorization that will end up to 7389115.

Many of programmers missed that one which cause the problem from easy to medium. It’s Simply a ad-hoc and totally based upon your implementation and nothing else.

So my suggestion is to work on it by own first. If you would not able to reach the solution then contact or comment there. I will explain the whole solution afterward.

Keep Coding!