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.
Hi,
I don't know the logic you are using but I think you need to find if n and k are co-prime to each other and if not then divide them with the common divisor and then apply your logic.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #183: Maximum product of parts
You are viewing a single comment's thread. Return to all comments →
Hi, I don't know the logic you are using but I think you need to find if n and k are co-prime to each other and if not then divide them with the common divisor and then apply your logic.