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 used all those tricks including Newton's method on the inverse square root in C++. Results: case 6 in 0.96 s, case 7 in 1.68 s and case 8 and 9 time-out. Should I just hand in the Python solution or do you have a final suggestion?
Project Euler #80: Square root digital expansion
You are viewing a single comment's thread. Return to all comments →
I used all those tricks including Newton's method on the inverse square root in C++. Results: case 6 in 0.96 s, case 7 in 1.68 s and case 8 and 9 time-out. Should I just hand in the Python solution or do you have a final suggestion?