23
mikael.desharnais
3 16 37
3059/ 3195
Mikael Desharnais http://desharnais.fr/
Last seen 7 months ago
Member for 4 years, 12 months, 3 days
Difficulty Normal
Best reviews / Newest reviews
colin_network_loops-colinmcnicholl 1 1
Very nice and thorough comments ! More
Weird?-obone 1 2
Did not use the sort method ? Why not ... More
rref-veky 1 1
Indeed ! Very short and speedy. Well done More
First-Ylliw 1
Simple : Python provides a pretty comprehensive API More
First-fatmakyba 1 1
Maybe a bit long but does the job. More
First-Sillte 1 1
Quite a short code, well done for this very hard mission More
Use FP, Luke!-obone 1
Very nice use of python syntax More
Dumb Army, Dumb Battle-obone 1 1
Two possible improvements : - Keep OOP style for the fight method - Keep encapsulation for the fight method More
Puzzling-Ylliw
Trying to enter a new career as an obfuscation engineer ? More
Quite StraightForward-mikael.desharnais
Thank you I often prefer a code with well named variables and methods to a commented code. It is a bit extreme but sometimes the comments hide the fact that the code is hardly readable. More
text formatting-vadym.zhukovskyy
Very well cut into small functions More
First, very very very slow slow slow-derrickding95
Well done ! Just being able to pass the final test is already a great success More
First-Sillte
Le dim. 22 sept. 2019 à 11:47, Mikael Desharnais < mikael.desharnais@gmail.com> a écrit : More
79-liner: indestructible jungle-przemyslaw.daniel
Very nice and short solution ! Welldonekaël Desharnais 336 rue Léon Porte 38360 Noyarey please-reply@checkio.org a écrit : More
Black Holes-JimmyCarlos
Nice and clean Mikaël Desharnais 336 rue Léon Porte 38360 Noyarey please-reply@checkio.org a écrit : More
First -LeonidPK
It works but it is sad not to keep OO style all the way to the end More
First-derrickding95
Pk, could improve OOP style : implement fight method in OOP and implement proper encapsulation More
Teleport-n-drop frozenset recursively-Ilis
Perfect use of recursion, straight and simple More
First-kodix09
The code is OK but you could have done it in a more pythonic way, for example : For the first line : result = [[0]*cols for i in range(rows)] or even for the whole code : result = [] for j in range(rows): result.append(list(range(start+cols*j,start+cols*j))) if rows%2==1: result[- More
1
2