April 30, 2023, 11:42 a.m. |
+ 1 |
for Comment
U.V: Well commented and educational solution.
|
Feb. 8, 2023, 11:44 a.m. |
+ 1 |
for Comment
lisovsky: Very similar to my solution, but I didn't make a separate function, but used lambda in sub
|
Feb. 6, 2023, 3:04 p.m. |
+ 1 |
for Comment
Magu: fabulous use of 'with suppress' and 'index'. very educational solution. :D
|
Feb. 1, 2023, 5:29 p.m. |
+ 1 |
for Comment
Phil15: For me the "important note" is that when the count is not enough to distingish elements, we rely on ...
|
Jan. 27, 2023, 7:50 p.m. |
+ 1 |
for Comment
lisovsky: lookup_table can be replaced by map_points = {c: sum(divmod(2 * (ord(c) - 48), 10)) for c in string....
|
Dec. 14, 2022, 11:55 a.m. |
+ 1 |
for Comment
hbczmxy: Thanks for your solution. It was in your solution that I first learned about `contextlib` (i.e. **th...
|
Nov. 21, 2022, 3:40 p.m. |
+ 1 |
for Comment
H0r4c3: A clear solution!
|
Nov. 15, 2022, 2:56 p.m. |
+ 1 |
for Comment
freeman_lex: You should find out the sorting order for each group, not once for the whole list. If the first grou...
|
Oct. 30, 2022, 8:08 p.m. |
+ 1 |
for Comment
Serg900vd: Here is the example using bubble sort: def __lt__(x, y): return y == 0 def bubble_sort(list): for pa...
|
Sept. 24, 2022, 3:35 p.m. |
+ 1 |
for Comment
H0r4c3: Nice use of deque!
|
Sept. 11, 2022, 7:07 a.m. |
+ 1 |
for Comment
berezanov82: Clear,short and educational solution!
|
Dec. 6, 2021, 1:41 p.m. |
+ 1 |
for Comment
Magu: proper comments for readability. nice. :D
|
Dec. 4, 2021, 5:44 p.m. |
+ 1 |
for Comment
jsg-inet: Nice to cover both posible solutions (positive and negative) when you are checking. Why to set the s...
|
Nov. 25, 2021, 1:16 p.m. |
+ 1 |
for Comment
mlahor: A well implemented classic solution. I did the same.
|
Nov. 11, 2021, 1:26 p.m. |
+ 1 |
for Comment
kdim: Your solution is easy to read and understand. Also complies with pep8. well done!
|
Aug. 5, 2021, 7:17 p.m. |
+ 1 |
for Comment
Kurush: There is an error in your solution. You can repeat it with "river_crossing(0, 2, 7, 3)". You’ll get ...
|
Aug. 3, 2021, 12:02 p.m. |
+ 1 |
for Comment
Marcin_Ramotowski: In your solution function path_to is unused and unnecessary. This solution works good without this f...
|
July 23, 2021, 3:41 p.m. |
+ 1 |
for Comment
ainoneko: > def heal(self, target): > """Damage is reduced if given heal() but cannot be negative. > Equivalen...
|
July 23, 2021, 3:30 p.m. |
+ 1 |
for Comment
RogerZ1128: elegant
|
July 6, 2021, 3:34 p.m. |
+ 1 |
for Comment
Phil15: Yeah B0 does not exist, but the "back" cone start there. I only used that name because it is clear w...
|
June 12, 2021, 7:41 a.m. |
+ 1 |
for Comment
r.bathoorn: you indeed create named tuples and use them but instead of this line 56: p1, p2 = edge you already c...
|
June 8, 2021, 6:12 p.m. |
+ 1 |
for Comment
_Chico__5d82cee4f5234e78a5c65e: Just a good solution:)
|
June 8, 2021, 6:08 p.m. |
+ 1 |
for Comment
_Chico__5d82cee4f5234e78a5c65e: Long, but nice!
|
May 28, 2021, 3:05 p.m. |
+ 1 |
for Comment
Phil15: Okay did not thought about these asserts, it should clearly be `assert list(...) == ...`. There is a...
|
May 26, 2021, 8:38 a.m. |
+ 1 |
for Comment
DinRigtigeFar: Really nice and clever answer although it took me a few minutes to figure it out.
|
April 15, 2021, 6:15 p.m. |
+ 1 |
for Comment
_Chico__5d82cee4f5234e78a5c65e: It's really readable. :)
|
Feb. 13, 2021, 5:54 p.m. |
+ 1 |
for Comment
Phil15: Okay I was about to lunch, read too quickly, was a bit a lazy to be entirely honest and I'm sorry fo...
|
Feb. 4, 2021, 2:21 p.m. |
+ 1 |
for Comment
oduvan: There might be an issue with solving in the last hour. Your quest was about voting for solutions, no...
|
Jan. 27, 2021, 2:18 p.m. |
+ 1 |
for Comment
Oleg_Levonjuk: Good job, but little bit verbose. With usage of textwrap the solution should be two or three times s...
|
Jan. 26, 2021, 4:25 p.m. |
+ 1 |
for Comment
Phil15: Yes
|
Jan. 7, 2021, 2:25 p.m. |
+ 1 |
for Comment
spark856: nice solution!
|
Jan. 7, 2021, 2:22 p.m. |
+ 1 |
for Comment
mangeurdecowan: gj
|
Jan. 5, 2021, 8:57 p.m. |
+ 1 |
for Comment
ogoro: thank you for extremely clear and documented code!
|
Nov. 28, 2020, 5:23 p.m. |
+ 1 |
for Comment
Phil15: This https://py.checkio.org/search/?q=with gave me 63 solutions. Only noticable use on the first 30 ...
|
Nov. 27, 2020, 4:31 p.m. |
+ 1 |
for Comment
kurosawa4434: [[86,28],[23,9],[5,13],[61,13],[73,17],[78,2],[91,17],[71,5],[68,8],[100,24],[24,26],[63,9],**[31,23...
|
Nov. 25, 2020, 7:52 p.m. |
+ 1 |
for Comment
kolomensky.vp: Dear Colin, thanks for your time and the rigorous review!
|
Oct. 28, 2020, 2:06 p.m. |
+ 1 |
for Comment
l.szyman10: Nice sets using. Wouldn't it be better to use: 'src not in crushes and dest not in crushes' instead ...
|
Feb. 6, 2020, 9:50 a.m. |
+ 1 |
for Comment
Ilis: Thank you so much for detailed review. It was hard for me to solve this task, so I didn't continue w...
|
Feb. 3, 2020, 9:26 a.m. |
+ 1 |
for Comment
rossras: nice use of eval() with unpacking to parse the points.
|
Jan. 30, 2020, 2:42 p.m. |
+ 1 |
for Comment
martin_b: Very thorough explanation
|
Jan. 25, 2020, 10:34 a.m. |
+ 1 |
for Comment
juestr: Thanks. Tbh most teams I've been with have house rules for longer lines, and allow to break the rule...
|
Jan. 25, 2020, 10:30 a.m. |
+ 1 |
for Comment
Phil15: Everybody can be the leader of the month in 2020 (but only one time), same for 2021, ... If you beco...
|
Dec. 20, 2019, 11:50 a.m. |
+ 1 |
for Comment
nickie: A fixed version of my [first solution](http://www.checkio.org/mission/painting-wall/publications/nic...
|
Dec. 19, 2019, 12:06 p.m. |
+ 1 |
for Comment
kurosawa4434: Hi colinmcnicholl. >one of those previous regions is fully overlapped by one of the other previous r...
|
Dec. 13, 2019, 10 a.m. |
+ 1 |
for Comment
Phil15: Great job with numpy! Even if I prefer my way with complex numbers. `cmath` module could do a part o...
|
Dec. 12, 2019, 10:58 a.m. |
+ 1 |
for Comment
Phil15: I don't see the vote +3. :-D > I like how your convex hull() function works from far left over high ...
|
Nov. 30, 2019, 10:06 a.m. |
+ 1 |
for Comment
annbelolikova: nice :) further, the same can be done without using len(set(...) if sum up directly: sum(1 for word ...
|
Nov. 27, 2019, 9:37 a.m. |
+ 1 |
for Comment
oduvan: should be fixed now
|
Nov. 4, 2019, 8:58 a.m. |
+ 1 |
for Comment
Ylliw: Nice and clear. I used the same method and convert it into a 1-liner. Less readable on one single li...
|
Oct. 30, 2019, 1:55 p.m. |
+ 1 |
for Comment
kurosawa4434: You have to find N in each test yourself. In the first example, N is 2. because there is no landing ...
|
Oct. 29, 2019, 10:35 a.m. |
+ 1 |
for Comment
kurosawa4434: In other words: * No obstacle hexes within **N** hexes. * **N** is maximum.
|
Oct. 26, 2019, 9:45 a.m. |
+ 1 |
for Comment
Phil15: I didn't know difficulty depend on the island too, at first. Dynamic programming is about this thing...
|
Oct. 25, 2019, 8:15 a.m. |
+ 1 |
for Comment
Phil15: First, it's "elementary" for the hubspot island, which is a difficult island, so not really elementa...
|
Oct. 16, 2019, 1:23 p.m. |
+ 1 |
for Comment
gubin.m.u: Short and to the point.
|
Oct. 16, 2019, 1:21 p.m. |
+ 1 |
for Comment
Trailblazer: Nice solution with %.
|
Oct. 12, 2019, 10:39 a.m. |
+ 1 |
for Comment
Ilis: Itertools is very suitable here. Clear solution.
|
Oct. 10, 2019, 9:24 a.m. |
+ 1 |
for Comment
kurosawa4434: Thanks @colinmcnicholl :-) As you think, You can get the list of random tests by running the functio...
|
Sept. 4, 2019, 1:40 p.m. |
+ 1 |
for Comment
huynhphillip57: Nice use of datetime and parameter expansion.
|
Aug. 31, 2019, 8:35 a.m. |
+ 1 |
for Comment
mikael.desharnais: Very nice and thorough comments !
|
June 26, 2019, 9:20 a.m. |
+ 1 |
for Comment
tanya: Good solution
|
June 7, 2019, 1:52 p.m. |
+ 1 |
for Comment
massif1: Thanks for sharing this solution. It's a different approach than mine (Regex + Counter) and you only...
|
May 29, 2019, 1:36 p.m. |
+ 1 |
for Comment
VangaroooYamada: so simple
|
May 29, 2019, 1:27 p.m. |
+ 1 |
for Comment
aleksandr.zaytcev: password = '' dimension = len(cipher_grille) for x in range(dimension): password += ''.join([ciphere...
|
May 21, 2019, 8:21 a.m. |
+ 1 |
for Comment
dannedved: A clean, readable and well-documented solution.
|
May 16, 2019, 8:57 a.m. |
+ 1 |
for Comment
caitlan: clear
|
May 16, 2019, 8:42 a.m. |
+ 1 |
for Comment
suic: Hi, here's a bit shorter alternative: ```python import string def checkio(str_number, radix): d = di...
|
May 15, 2019, 1:20 p.m. |
+ 1 |
for Comment
pcresolver: I like that you describe the challenge so that we know what the code is doing.
|
May 14, 2019, 9:23 a.m. |
+ 1 |
for Comment
juestr: A few suggestions: - ```for row, line in enumerate(lines)```, manual counting isn't very pythonic - ...
|
April 30, 2019, 1:55 p.m. |
+ 1 |
for Comment
vtflnk: The best solution.
|
April 27, 2019, 9:51 a.m. |
+ 1 |
for Comment
Phil15: Private messages could be useful. You removed your entire forum post, not just the last comment. So ...
|
April 10, 2019, 10:11 a.m. |
+ 1 |
for Comment
ayubutrym: In this case the division yields an integer result (it's the C_nm -- number of combinations) that's ...
|
April 9, 2019, 10:01 a.m. |
+ 1 |
for Comment
ayubutrym: Line 9 could use integer division `//` with the same effect of rounding to the nearest smallest inte...
|
April 4, 2019, 8:40 a.m. |
+ 1 |
for Comment
alphamikevictor: Nice approach, It would be nice to take a look to [Python's all](https://docs.python.org/3/library/f...
|
March 20, 2019, 2:25 p.m. |
+ 1 |
for Comment
qurutrevor: Very Pythonic.
|
March 5, 2019, 9:22 a.m. |
+ 1 |
for Comment
przemyslaw.daniel: don't hesitate to upvote it then ;-)
|
Feb. 25, 2019, 9:29 a.m. |
+ 1 |
for Comment
itheklon: You don need: if end_position < 0: end_position += (side-1)*4 if you use (number)%Z - you get a poit...
|
Feb. 19, 2019, 9:41 a.m. |
+ 1 |
for Comment
arthurdias-trad: Good, simple and clean solution. However, on the odd length solution, you don't need to add and subt...
|
Feb. 12, 2019, 9:55 a.m. |
+ 1 |
for Comment
JimmyCarlos: This is a really clear and well put together solution, using simple maths to make a concise answer.
|
Feb. 12, 2019, 9:53 a.m. |
+ 1 |
for Comment
vit.aborigen: good comments
|
Jan. 19, 2019, 10:36 a.m. |
+ 1 |
for Comment
Merzix: if (len([elem[0] for elem in pairs]) != len(set([elem[0] for elem in pairs]))): return False else: r...
|
Dec. 21, 2018, 10:55 a.m. |
+ 1 |
for Comment
BrianMcleod: This solution fails on assert can_balance([6,1,10,6,1]) == -1 It gives the answer 2
|
Dec. 15, 2018, 11:55 a.m. |
+ 1 |
for Comment
Phil15: There is also the "comprehension thing": n for start, stop in items for n in range(start, stop + 1)
|
Dec. 15, 2018, 11:37 a.m. |
+ 1 |
for Comment
Phil15: I started to think I would not see `list.extend(range(...))`. But you can unpack tuples from items b...
|
Dec. 10, 2018, 7:07 p.m. |
+ 1 |
for Comment
tigerhu3180: For line 26-33, we have the same idea and here is my code. {i: True if i < len(items) - 1 and items[...
|
Dec. 10, 2018, 11:55 a.m. |
+ 1 |
for Comment
tokyoamado: @colinmcnicholl Thank you for comment. First, I'm no good with English so I afraid that I may misund...
|
Nov. 2, 2018, 2:56 p.m. |
+ 1 |
for Comment
Phil15: return items == sorted(items) and not (len(items) > 1 and len(set(items)) == 1) is enough but False....
|
Oct. 16, 2018, 6 p.m. |
+ 1 |
for Comment
fed.kz: I noticed that your program does not work correctly for a string of 10 characters. braille_page('a'*...
|
Oct. 14, 2018, 8:16 p.m. |
+ 1 |
for Comment
Infini7y: Better... although use the list instead of assigning variables to each element. If your already work...
|
Oct. 4, 2018, 4:39 p.m. |
+ 1 |
for Comment
Phil15: Lines 15-20 in a else and 'return nothing' can disappear :) I never used collections.defaultdict yet...
|
Oct. 3, 2018, 7:44 p.m. |
+ 1 |
for Comment
Phil15: I put a special case when the given length is N**2, it's just the sum of all numbers. Well, it's tru...
|
Oct. 3, 2018, 7:39 p.m. |
+ 1 |
for Comment
swagg010164: If the path length is N^2 (3x3 - 9, 4x4 - 16, 5x5 - 25), then this is an exception and this algorith...
|
Oct. 2, 2018, 10:29 a.m. |
+ 1 |
for Comment
swagg010164: I meant that during the execution of the algorithm, we remember all the vertices that we visited. Si...
|
Oct. 1, 2018, 7:33 p.m. |
+ 1 |
for Comment
Phil15: You seem to like OOP now. I don't understand all of the code, it seems complicated. Well I was looki...
|
Sept. 23, 2018, 7:56 p.m. |
+ 1 |
for Comment
HeNeArKr: I think the hint is a little misleading. `results[x]` tells you if the current player will win or lo...
|
Sept. 20, 2018, 10:03 a.m. |
+ 1 |
for Comment
Sillte: Thank your for your comments! I appreciate your advice. I'd like to write about the main topic. Firs...
|
Sept. 12, 2018, 7:48 a.m. |
+ 1 |
for Comment
kurosawa4434: Thank you :) Can you get 3.63 when shooting (3, -5) and (1, -20)? If not, I don't know unless see yo...
|
Sept. 9, 2018, 7:24 p.m. |
+ 1 |
for Comment
Phil15: math.hypot(x, y) == math.sqrt(x**2+y**2) def double_distance(point_1, point_2): dx = abs(point_2[1] ...
|
Sept. 9, 2018, 11:25 a.m. |
+ 1 |
for Comment
Phil15: Hello my friend, First when post a message, use two line break for have a line break on output. It w...
|
Sept. 7, 2018, 4:43 p.m. |
+ 1 |
for Comment
mindaugas.dadurkevicius: Clear, but you could have simplified it to less cases (for instance amounting to length by reading e...
|
Sept. 5, 2018, 6:12 p.m. |
+ 1 |
for Comment
Phil15: First, you have done it, bravo. But * I don't like you have to rewrite equip weapons for every subcl...
|