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.
Same solution in PyPy3! Speed up was enough to pass all cases but python3 is still too slow.
Idea is to check if you have already calculated value for n, and if not then to add it to the dictionary.
Recursion: Davis' Staircase
You are viewing a single comment's thread. Return to all comments →
Same solution in PyPy3! Speed up was enough to pass all cases but python3 is still too slow. Idea is to check if you have already calculated value for n, and if not then to add it to the dictionary.