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 completed the problem, and while interesting, the difficulty level surely needs to be increased to at the very least, hard, if not advanced. I had to use a sublinear algorithm for the mertens function to get under the time limit. Unless there is an easier way that I happened to miss (or a way that wasn't compatible with the time-constraints for Julia), I find it a little ridiculous that a problem that requires a sublinear algorithm for the Mertens function be considered a medium difficulty problem. (Yes, that's a bit of a spoiler but it was released five years ago so I feel that's acceptable now.) The edge-cases were also a little silly...
Project Euler #193: Squarefree Numbers
You are viewing a single comment's thread. Return to all comments →
I completed the problem, and while interesting, the difficulty level surely needs to be increased to at the very least, hard, if not advanced. I had to use a sublinear algorithm for the mertens function to get under the time limit. Unless there is an easier way that I happened to miss (or a way that wasn't compatible with the time-constraints for Julia), I find it a little ridiculous that a problem that requires a sublinear algorithm for the Mertens function be considered a medium difficulty problem. (Yes, that's a bit of a spoiler but it was released five years ago so I feel that's acceptable now.) The edge-cases were also a little silly...