15
Eldin
● 3 ● 11 ● 26
1155/ 1195
Last seen 11 months ago
Member for 10 years, 2 months, 10 days
Difficulty Normal
Best reviews / Newest reviews
Simpler O(n^4)-DiZ 2 1
looks great, don't understand a bit of it :D More
Front To Back-DanielDou 1
Nice use of palindromic words inside your code. gotta love that touch :D More
First-agdk26 1
Nice work using the set and generator! More
Bytecode Analysis-PositronicLlama 1
Why would you go through all this trouble! It's impressive, true but I got this: class checkio(): def __init__(self, anything): pass def __eq__(self, other): return True def __ne__(self, other): return True def __gt__(self,other): r More
First-petrushev 1 1
the issubset method is the one I was looking for but forgot about. Noce work. More
Very well working-Eldin 1
well, first I tried do do: [False].append(list(random.choice(opencells)) But that returned None. So this was my fixer up. any good thoughts? More
First-bukebuer
Wow, the simplicity is stunning More
Double ended-veky 1
just for my info, why is it better to use deque instead of just a list where you do > list.pop(0) ? More
First-ignalion 1
It's great, but for the lift of me I can't figure out why the sum of all part-gold fractions -1 /2 is equal to the total of gold... More
__-Cjkjvfnby
You're so close, why not make it a on-liner :D More
First-baozhao123
Code could be clearer but hey, it works right :D More