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 was able to get around this by coding that if n is large then divide n by the first k primes and in that case incriment my unique prime counter by k.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Leonardo's Prime Factors
You are viewing a single comment's thread. Return to all comments →
I was able to get around this by coding that if n is large then divide n by the first k primes and in that case incriment my unique prime counter by k.