22
zeixes
6 18 37
2911/ 2945
Михаил Емельянов
Last seen 8 hours ago
Member for 1 year, 7 months, 22 days
Difficulty Normal
Best reviews / Newest reviews
Single dict lookup per move-StefanPochmann 1 1
Sorry, man i was wrong in my comment, because i didn't test your soluthion properly. More
First-wo.tomasz 1
Good solution. It readable, all functions are simple and that nice. Smart using reduce function. More
First-viktor.chyrkin 1
Variables bad named, thats why it hard to understand what it mean (but good that complex list comprehanshions not here). But how it wirk with horizontal and vertical search - my respect! More
Oneliner-gleb10101010101 1
Excellent solve! I think you published it in wrong category, and this solve must be in "Speedy" =) More
divmod-Sim0000 1
At first sight it solve is short, but not readable because of one-letter variables. But then if thinks how it works, it really great and simple solution, and, i think, it should be in "Fast" category. Thanks for published it =) More
First-hypehr96 1
Great! And real clean solution, all code is readable. Recursion in this format - realy good and safe, but not fast. More
OOP-flatline 1 1
Intersting that you use here class. Fun both places - first - range(1, 6+1), that for those, who don't know haw many sides on standart dice, or didn't saw picture in description, - second - class Die - ш ертл it misprint =) More
numpy.roll-kurosawa4434 1
I don't know about existing of this module =) Thanks for show this. Nice! More
First-mildm
Interesting solve with recursion, but not so fast (and so, i think, not in "Speedy" cathegory =) ). Almost readable. More
First-mildm
What a dark magic with indexes =) Really interesting solution. And i think it should be in "Speedy" cathegory. More
First-psdiegops
It can be speedy solve, if string value goes from function argument, or if you make a variable for string value of number and not change type in calculation of returned value. Despite this it solve excelent. More
Solution for "End Zeros"-Mariusz_Lesniak
It really creative to use while in this solution! But you should make variable for len(str(num)) and call this value at once. And intersting condition for find zeros. Nice. More
Single dict lookup per move-StefanPochmann 2
Maybу it is fast, but it takes a lot of memory for dict if we have many moves at input data. More
First-hanpari
Interesting solution, short and fast. I don't thought about usage "next" here, but it really can be fast =) More
with StringIO-karlian
Interesting solution. At first, it really not one of many monotonous solutions with suppres =). At last, it nice to use generator to prepare text. More
divmod%-Phil15
Great and short solution. I think, it can be in cathegory "Speed", because all calculations reduced to one divmod. Really smart and educational. More
zip_longest-mikehult123
Nice using ":=" with func. Such organization of returns in main function really useful. More
Hidden word-WitalyK
Really good solve without using zip_longest. More
First-dig
Realy creative and simple, but i think it takes much memory. More
advanced mult-python.bekzod
Great, it shows that objects in python using everywhere, and they have own "magic" methods. More
1
2