10
PavloTaiko
1 6 21
440/ 545
Pavlo Kovalchuk
Last seen 6 years ago
Member for 10 years, 11 months, 28 days
Difficulty Normal
Best reviews / Newest reviews
First-Sim0000 2
yours kung fu is stronger than my More
Indexcept-veky 1
This is a koan: if you need to return error code you might want to use error handler. More
Altarfinch's compressed-veky 1 1
e=lambda n,t,s:[n+c for l in t if n==l[0]for c in e(l[1],t-{l,l[::-1]},s-{n})]if s or n>'1'else[n] it remainds me brainfuck and perl, but looks cool anyway. More
First-cesarkawakami
try DIRS = itertools.combinations(range(-1,2),2) More
First-old_user
assert checkio([10,10]) == 0, 'First, with equal weights' Yeah, you know this tricky package. You done this test well. Be proud of it. Damn I am pretty envying because of that. ^_^ More
Trolling :)-AndriusMk
Lol. Someday it would reach it! Probably. If maze is nice. I like it. More
First-astynax84
hm, almost as my, but with map instead generator More
Second-nyncuk 1
Why so complicated? Just zip(*matr) is enough. More
First-hyry
Really cool. With generator! Yeah! PS. len(set(route)) == 8 - oh my, I have totally ugliest solution here. Big shame for me. More
After Tubis-nickie 1
This even more awesome because of this tricky part with True. More
First-madmanbob
elvis is the only reasonable solution here More