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.
Don't try to find every number's prime factors, you have no chance not to get timeout errors.
Think about sieve of eratosthenes algorithm. Don't you go through all numbers with each prime. That's the trick.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #47: Distinct primes factors
You are viewing a single comment's thread. Return to all comments →
Don't try to find every number's prime factors, you have no chance not to get timeout errors. Think about sieve of eratosthenes algorithm. Don't you go through all numbers with each prime. That's the trick.