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.
Yes, I agree. The problem description is kind of confusing. It took me a while to figure out what the problem actually meant.
Basically it is asking like:
Find any numbers (up to 100) which have the maximum number of unique prime factors. For example of N=100, while 30=2*3*5 or 42=2*3*7 which consist of 3 prime numbers, while the smallest number which can have 4 prime facters is 2*3*5*7=210, which is over 100. So the answer is 3 comes from either 30 or 42.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Leonardo's Prime Factors
You are viewing a single comment's thread. Return to all comments →
Yes, I agree. The problem description is kind of confusing. It took me a while to figure out what the problem actually meant.
Basically it is asking like: Find any numbers (up to 100) which have the maximum number of unique prime factors. For example of N=100, while 30=2*3*5 or 42=2*3*7 which consist of 3 prime numbers, while the smallest number which can have 4 prime facters is 2*3*5*7=210, which is over 100. So the answer is 3 comes from either 30 or 42.