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
Touch the right wall-maurice.makaay 1
Not universal, but funny :-) And I like "properties". Nice! More
First-undead404 1
Change input data is not a good practice. You can use work = sorted(data) instead line 6-7 amount = len(data) line 9 is overhead if amount % 2: # the same as amount % 2 != 0 and line 13 is not needed. More
First-vojpivna
It's scary. Lines 5-21 are .... More
Dijkstra-Complete-Miaou 1
Nice comments, but too long lines. More
A*-PositronicLlama
Do you think A* is not overkill algorithm for this task? I don't sure about heuristic. But +2 for implementation and +1 for good comments. More
First-bryukh
any([ch.isupper() for ch in data]) and I prefer list comprehension. For memory problem, i can just to replace list comprehension to generator comprehension. If honestly, i don't like map and filter. More
Pedantic-htamas 1
Really pedantic and accurate. Super. More
First-davidpm 2
" == True" is redundant. "range(0, len(list_of_words))" -- 0 is default, so you can use range(x) == range(0, x) And you can iterate through list instead indexes: for w1 in list_of_words: for w2 in list_of_words: More
Assignment-veky 1
A cool trick with the double assignment. More
First-Avaris
for x, y in itertools.product(range(4-size), repeat=2): Nice idea More
SquareNSortIt-suwanditan
Too many manual work and if you will decide to change for bigger square... More
First-parmando
tab=recur(tab,value+1,x1-1,y1+2) You can make it shorter and readable using a loop. More
Gaussian elimination-htamas
Of course. Thanks, i tried to solve it with linear equations and made a mistake. Now i see where is my mistake. More
Second-AlexeyIvchenko
key = lambda x: x[1] * 1000 - ord(x[0]) Hm, it looks weird imho. What is it? More
First-htamas
I think you can place it in the "Speedy" category. More
First-Amachua 1
It's almost "clear" solution. Short and simple, but please don't use long lines -- it's hard for reading. :-) The new PEP8 allows 100 characters per line. More
First-htamas 1
Tricky :) It can be placed in the "Speedy" category. More
First-bukebuer 1
**bin()** and **int(n, 2)** can help here :) More
First-pawlyk
It does not look as "Clear" solution. The long lines, the bad names. I agree with [Cjkjvfnby's comment.](http://www.checkio.org/mission/humpty-dumpty/publications/pawlyk/python-27/first/#comment-outer-9032) More
Refactored-nickie
This is not "Clear" (as you said), but it's interesting solution. More
1 2 3 4 5
6
7 8