Alexandrian Integers
My old code is close to brute force. It runs for 4.4 seconds after I restricted the number to be tested.
I used the algorithm that is used in problem 216. It is quite fast. Only 0.3 second needed. There is a few other algorithms that is also very fast to solve this problem.
No comments:
Post a Comment