24
amandel
8 26 43
3426/ 3445
Awesome Team Arnaldo Mandel
Last seen 7 hours ago
Member for 3 years, 2 months, 24 days
Difficulty Advanced
Best reviews / Newest reviews
Finally correct-amandel 1
BTW, increasing max_e and max_pi to 3, and even to 4 leads to some surprising results. For instance, try chekio(pi) with those values at least 3. More
Kesteleyn-amandel
This solution is way faster than the recursive one. A good family of tests is running on n*[n], with n even. The recursive one churns answers up to n=18, and dies miserably with n= 20. This one has no problem with n=30, and could probably go further. More
Solution for "The Brick Factory Problem" #1-zeixes
Why speedy? Lots of constant time simpler, and probably faster, solutions. More
keep count of repetitive letters-jang.cw 1
You should learn what a stack is. More
Heap-amandel
Never mind this wasteful and slow solution, look at the Recursive one, under Speedy. More
First-Doppelok
Plain solution, not very pythonic. More
1 2 3
4