45
bryukh
16 32 48
15857/ 17173
Valentin Bryukhanov http://bryukh.com/
Last seen 2 years ago
Member for 11 years, 7 months, 16 days
Difficulty Normal
Developer, engineer and taskMaker.

Best reviews / Newest reviews
First-jcg 1
Thank you for the interesting comments. More
First-coells 1
This is a surprise solution. Great! More
First-tuxninja 1
You don't need line 2. Just `def checkio(number):` if you don't like 'data' name. More
Solution for anything Class-based.-diegueus9 1
Simple and clear. And a good idea about "call". Nothing to add :-) More
pbs-veky 1 1
At first look i thought "This is not a puzzle. I see indents and docstring. It's clear solution and Veky didn't write it" :) But then... You broke my brain. Now i have the puzzle for weekend. More
Friends - too many strings, but it's mine)-AleksandrKasianov 1 1
"self.connection = connection" is redundant in "add" or "remove" methods. You don't need save them in the instance. line 7 if isinstance(self.connections,tuple): Why do you check it in "add" method? You save "connection**S**" in init. If you are using "if self.connection in to_list_connectio More
Comprehend-veky 1 1
It's real short! But too slow. Yes, you are lazier than i am :) More
Clear Regex and Sets-tarikki 1 1
Column programming style :-) it's something new. I think you should move this in "Creative" :-) More
Second-ajmssc 1
You forgot about spaces around operators (pep8). if cell[0]==10 and cell[1]==10: You can make it simpler if cell == (10, 10): line 4 -- "== 1" is not necessary if lab[cell[0]][cell[1]]: line 13-17 min(paths, key=len) But for the shortest path you can use BFS More
even odd-bunnychai 1
o + o Looks like smile :) More
First-bryukh
I do not participate in the competition. It's quick test solution. More
First-rmidyanyy 1
It's Depth-first search, right? Interesting using of "for...else.." construction. But it's bad practice to change input list. More
First-onii
Sometime you use whitespace around operators, sometime -- not. More
First-mdreid
It's not DRY (Don't Repeat Yorself). You can merge four block for moving in one loop or function. And "return" without anything is not good -- it's little confuse. Good comments. More
Dijkstra-Short-Miaou
Reduced Dijkstra is nice :) Good comments, but too long lines. More
Second-Bibiche
Hard to read long lines. For unsolvable puzzle, you can check solvability (count inversions). More
Сombinatorics-bryukh 1
it's not fast -- i know, i can cached some variants for speed. But sometime i am lazy :) More
Recursive Generators-AndriusMk
Great solution. Simple for understanding. I agree with Kvas about Fraction -- slow thing. But this solution easy modified to float. So it's not important. Thank you for interesting solution. More
Trolling :)-AndriusMk
:) Thanks for this solution. It's funny, really. Crazy blind adventurer :) More
First-andy_s
Nice. I like these docstrings. More
1 2
3
4 5 6 7 8