May 11, 2019, 3:52 p.m. |
+ 1 |
for Comment
kurosawa4434: I have been unable to resolve your Christmas present for a long time. But now, my solution is almost...
|
May 9, 2019, 7:06 a.m. |
+ 1 |
for Comment
kurosawa4434: Finally I finished this mission. However, it takes 8 minutes for Check to complete. (Especially 5 mi...
|
May 2, 2019, 8:12 p.m. |
+ 1 |
for Comment
kurosawa4434: I made improvements to use the error information of referee.py for visualization. Please check the p...
|
April 29, 2019, 8:08 a.m. |
+ 1 |
for Comment
Ilis: `zip(path[:-1], path[1:])` explicitly shows I want to pair lists shifted one item. Using implicit be...
|
April 26, 2019, 12:16 p.m. |
+ 1 |
for Comment
Ilis: All done in new beautified solution: https://py.checkio.org/mission/climbing-route/publications/Ilis...
|
April 25, 2019, 8:06 a.m. |
+ 1 |
for Comment
aya.kanazawa: lru_cache saved me! Thanks!
|
April 24, 2019, 7:37 p.m. |
+ 1 |
for Comment
Ilis: Ahhhaha, my traverse algorithm is not BFS, but DFS (depth-first search). It is good for finding all ...
|
April 24, 2019, 2:10 p.m. |
+ 1 |
for Comment
Ylliw: Thanks to your suggestion, I dig into the timing of my code. All the unnecessary stuff (including de...
|
April 13, 2019, 5:24 p.m. |
+ 1 |
for Comment
oduvan: I've merged everything yesterday. Thank you.
|
April 13, 2019, 7:45 a.m. |
+ 1 |
for Comment
veky: Or simply give us tuples. (Or frozensets, if you wanna be fancy.;)
|
April 13, 2019, 7:43 a.m. |
+ 1 |
for Comment
Jeevananthan_Shanmugam: Finally i have completed the task after long fight, thanks for the input.
|
April 12, 2019, 12:50 p.m. |
+ 1 |
for Comment
froot123: incredible.. god, is it u?
|
April 9, 2019, 8:05 a.m. |
+ 1 |
for Comment
HeNeArKr: Indeed! You have expanded my understanding of tuples. I would have thought that `min(list_of_tuples)...
|
April 7, 2019, 7:09 a.m. |
+ 1 |
for Comment
Sim0000: I rewrite your code. I hope this may help you :-) def all_the_same(elements): if not elements: retur...
|
April 5, 2019, 2:25 p.m. |
+ 1 |
for Comment
keneda212: > Great job, you did it! I am always amazed to see people write so many lines of code for these prob...
|
April 3, 2019, 6:05 p.m. |
+ 1 |
for Task
Evenly Spaced Trees
|
April 3, 2019, 6:04 p.m. |
+ 1 |
for Post
New Mission "Evenly Spaced Trees"
|
April 2, 2019, 2:47 p.m. |
+ 1 |
for Comment
JamesArruda: `is_ray` is really great. I'm stealing that construct :) The only constructive criticism I'd give fo...
|
April 2, 2019, 9:40 a.m. |
+ 3 |
for
Heuristic search for most contentious light-JamesArruda
|
April 1, 2019, 8:06 a.m. |
+ 1 |
for Comment
keneda212: great mission, challenging and resolved. I like it :)
|
March 30, 2019, 6:10 p.m. |
+ 1 |
for Comment
Sillte: Thank you for your comment! When I tried this problem for the first time, my code was very messy and...
|
March 30, 2019, 5:38 p.m. |
+ 1 |
for Comment
Sillte: Thank you for nice problems and comments! Writing programs for solutions of puzzles are good practic...
|
March 27, 2019, 4:47 p.m. |
+ 1 |
for Comment
quarkov: You might have come to the same conclusions hence=) I've not even considerd any re implementations b...
|
March 27, 2019, 8:33 a.m. |
+ 1 |
for Comment
JimmyCarlos: Hi Phil15, Thanks for the puzzle - easily the hardest I ever have solved on CheckIO. It was VERY tou...
|
March 26, 2019, 10:02 a.m. |
+ 2 |
for
numpy-rodka81
|
March 19, 2019, 1:37 p.m. |
+ 2 |
for
zip(q, q)-veky
|
March 18, 2019, 8:19 p.m. |
+ 1 |
for Comment
veky: Wow, a set! :-D
|
March 18, 2019, 8:18 p.m. |
+ 1 |
for Post
New Mission "Broken Window"
|
March 14, 2019, 6:40 p.m. |
+ 1 |
for Comment
oduvan: the most inspirational part of my job :)
|
March 12, 2019, 7:54 a.m. |
+ 1 |
for Comment
przemyslaw.daniel: Let's move it then to creative category
|
March 3, 2019, 8:08 a.m. |
+ 1 |
for Comment
JamesArruda: Finally solved it! I took a break for a while to clear my head. My recursive solutions weren't behav...
|
Feb. 24, 2019, 4:04 p.m. |
+ 1 |
for Comment
Vladimir_Marunin: Hmm, what exact code do you use? def checkio(args): or def checkio(*args) In post I don't see asteri...
|
Feb. 20, 2019, 9:16 p.m. |
+ 1 |
for Task
Flood Area
|
Feb. 20, 2019, 9:01 p.m. |
+ 1 |
for Post
New Mission "Flood Area"
|
Feb. 14, 2019, 9:45 p.m. |
+ 2 |
for
from scipy.sparse.csgraph import dijkstra again-fokusd
|
Feb. 12, 2019, 3:30 p.m. |
+ 1 |
for Comment
Vladimir_Marunin: +1 to @Phil15 I can't solve this tasks too, because full search is impossible. I've tied "simple and...
|
Feb. 7, 2019, 11:12 a.m. |
+ 1 |
for Comment
fenryxo: I really smart solution :-)
|
Feb. 6, 2019, 3:08 p.m. |
+ 1 |
for Post
New Mission "Find Quotes"
|
Feb. 6, 2019, 2:14 p.m. |
+ 1 |
for Comment
oduvan: @Merendina can you help here?
|
Feb. 5, 2019, 5:40 p.m. |
+ 3 |
for
from scipy.sparse.csgraph import dijkstra-fokusd
|
Feb. 5, 2019, 5:12 p.m. |
+ 1 |
for Comment
oduvan: about the diff mission. I don't think we have one.
|
Feb. 5, 2019, 11:39 a.m. |
+ 1 |
for Comment
Vladimir_Marunin: It is NP-full task https://en.wikipedia.org/wiki/Independent_set_(graph_theory) But you proposed O(n...
|
Feb. 4, 2019, 1:17 p.m. |
+ 1 |
for Comment
kurosawa4434: defaultdict() takes a function with no argument instead of type. dict_int = defaultdict(int) dict_li...
|
Feb. 2, 2019, 3:32 p.m. |
+ 1 |
for Comment
megaexception: wow, it's really unexpected, but clearly very cool. your solution is very brief, concise, and about ...
|
Jan. 31, 2019, 8:51 a.m. |
+ 1 |
for Comment
Gabbek: I had so much fun solving this puzzle. I've learned quite a lot! My solution is far from perfect, bu...
|
Jan. 31, 2019, 7:56 a.m. |
+ 1 |
for Comment
oduvan: I think if users will have a first mission with print they will keep using print instead of return i...
|
Jan. 28, 2019, 8:16 p.m. |
+ 1 |
for Comment
Gabbek: Thanks to your post I found a bug in my solution :) Will report the findings in 2 days! Thank you!
|
Jan. 27, 2019, 8:25 a.m. |
+ 1 |
for Comment
JamesArruda: Finally! The test cases were well selected, especially that last one (at least for how I had started...
|
Jan. 26, 2019, 5:08 p.m. |
+ 1 |
for Comment
JamesArruda: I think I missed that precondition, and it makes sense. Thanks for the response! I've always thought...
|
Jan. 26, 2019, 12:45 p.m. |
+ 1 |
for Comment
Sim0000: Thanks! This information is very useful. My code was able to solve the 100x100 problem within one mi...
|
Jan. 25, 2019, 9:25 a.m. |
+ 1 |
for Comment
oduvan: We can make a fork of CheckiO. Every new user get a set of random modules to solve coding puzzles
|
Jan. 22, 2019, 10:33 a.m. |
+ 1 |
for Comment
Hiroaki_Ebihara: Sorry for replying you late. Thanks your advice!! I'll try to write code much more easily.
|
Jan. 21, 2019, 2:14 p.m. |
+ 1 |
for Comment
oduvan: sorry, later I add precondition about same size of two strings
|
Jan. 21, 2019, 12:59 p.m. |
+ 2 |
for
ndimage-gyahun_dash
|
Jan. 17, 2019, 8:49 p.m. |
+ 1 |
for
This week’s missions: Isometric Strings and Fortress Cannons
|
Jan. 17, 2019, 9:03 a.m. |
+ 1 |
for Comment
Merzix: Of course, there is no direct relationship between the task and Deep Learning. I read about Deep Lea...
|
Jan. 14, 2019, 3:57 p.m. |
+ 1 |
for Comment
Merzix: assert isometric_strings('adp', 'egg') == True # or False?
|
Jan. 14, 2019, 12:52 p.m. |
+ 1 |
for Post
New Mission "Isometric Strings"
|
Jan. 13, 2019, 8:55 p.m. |
+ 1 |
for Comment
Tayozhniy: https://translate.yandex.ru/?lang=ru-en&text=Если%20с%20первого%20раза%20не%20удалось%20обнаружить%2...
|
Jan. 11, 2019, 7:51 a.m. |
+ 1 |
for Comment
przemyslaw.daniel: Can I have them all? ;-)
|
Jan. 10, 2019, 9:14 a.m. |
+ 1 |
for Comment
kurosawa4434: I improved 'checker.py'. 'Check' became more efficient.
|
Jan. 9, 2019, 11:27 a.m. |
+ 1 |
for Comment
tigerhu3180: Suddenly one mind flashed in my head. Is there any situation when I get a gem then I cannot get out....
|
Jan. 9, 2019, 8:37 a.m. |
+ 1 |
for Post
New Mission "Fortress Cannons"
|
Jan. 8, 2019, 3:23 p.m. |
+ 1 |
for Comment
oduvan: into it right now
|
Jan. 6, 2019, 9:06 a.m. |
+ 2 |
for
OOP with dataclasses-rodka81
|
Jan. 6, 2019, 8:49 a.m. |
+ 2 |
for
First-tigerhu3180
|
Jan. 5, 2019, 2:21 p.m. |
+ 1 |
for Comment
Sim0000: My solution use Dijkstra only. We can see given map as two layer map with extra direction up and dow...
|
Jan. 5, 2019, 2:05 p.m. |
+ 1 |
for Task
Express Delivery
|
Jan. 4, 2019, 10:09 a.m. |
+ 1 |
for Comment
tigerhu3180: I use Ctrl + B to execute my code. Anyway. I install package 'python checker' and 'python debugger'....
|
Jan. 2, 2019, 12:57 p.m. |
+ 1 |
for Comment
oduvan: Happy New Year!!! And thank you all for the 2018! It was really fun!
|
Jan. 2, 2019, 10:02 a.m. |
+ 1 |
for
Second-fed.kz
|
Jan. 2, 2019, 10:02 a.m. |
+ 1 |
for Comment
fed.kz: I think for a big array, `count` will works slowly than `try/except`. Because `count` will check all...
|
Jan. 2, 2019, 9:43 a.m. |
+ 1 |
for
First-BrianMcleod
|
Jan. 1, 2019, 9:17 a.m. |
+ 1 |
for Post
*** 2019 ***
|
Dec. 22, 2018, 11:19 a.m. |
+ 1 |
for Comment
kurosawa4434: Thank you for your description. I like this puzzle : D I think that it is important to play puzzle e...
|
Dec. 22, 2018, 9:30 a.m. |
+ 1 |
for Comment
mortonfox: Wow, what an interesting challenge! This is a puzzle that is harder than it appears at first, mainly...
|
Dec. 21, 2018, 5:58 p.m. |
+ 1 |
for
This week’s mission: Net Game
|
Dec. 21, 2018, 1:08 p.m. |
+ 1 |
for Comment
oduvan: this is awesome :) Thanks
|
Dec. 20, 2018, 1:35 p.m. |
+ 1 |
for Comment
kurosawa4434: I sent a pull request. >But it may be slow with the last and big test 25x40. I agree. I decided to c...
|
Dec. 20, 2018, 8:56 a.m. |
+ 1 |
for Comment
kurosawa4434: I am creating an animation. I will attach a sample of the image :)
|
Dec. 19, 2018, 4:37 p.m. |
+ 1 |
for Comment
kurosawa4434: Hi @Phil15 You are awesome ! The first mission you made is great.(And it is very tough :-)) I would ...
|
Dec. 19, 2018, 12:01 p.m. |
+ 1 |
for Comment
spanring: oh, i like the coloring approach :-)
|
Dec. 19, 2018, 9:24 a.m. |
+ 1 |
for Comment
veky: You could have given me credit. :-P But people will probably recognize my style anyway. ;-]
|
Dec. 18, 2018, 12:50 p.m. |
+ 1 |
for Comment
oduvan: That was a long quest. https://py.checkio.org/user/oduvan/quests/resolve-forum-post/618265/ Don't fo...
|
Dec. 18, 2018, 12:38 p.m. |
+ 1 |
for Comment
oduvan: Logo can't be applied automatically, I'll add it, no worries
|
Dec. 18, 2018, 9:47 a.m. |
+ 1 |
for Comment
oduvan: https://github.com/Philippe-Cholet/checkio-mission-net-game/blob/master/editor/initial_code/python_3...
|
Dec. 17, 2018, 9:25 a.m. |
+ 1 |
for Comment
oduvan: Did you create the repo? Here is a short video but for the old tool. https://youtu.be/CFzsHtdvND8?t=...
|
Dec. 17, 2018, 9:24 a.m. |
+ 1 |
for Comment
oduvan: >Thanks for your patience You should not be worried about it at all.
|
Dec. 16, 2018, 5:46 p.m. |
+ 1 |
for Comment
DahliaSR: It was not a bad idea. Don't feel bad for having an idea, that had good intentions. @Phil15 already ...
|
Dec. 15, 2018, 2:31 p.m. |
+ 1 |
for Comment
Morph: Thanks for the help, It was still failing so I added a break once the count == 3: > count = 0 word_l...
|
Dec. 15, 2018, 9:13 a.m. |
+ 1 |
for
Chessboard-veky
|
Dec. 15, 2018, 9:07 a.m. |
+ 1 |
for
TRY YOUR LUCKY-tdhr
|
Dec. 15, 2018, 9:05 a.m. |
+ 1 |
for
1-liner: +marriage-przemyslaw.daniel
|
Dec. 13, 2018, 9:58 a.m. |
+ 1 |
for Comment
oduvan: the bug should be fixed already, try to update the client. Sorry for not following up, I think the b...
|
Dec. 13, 2018, 9:06 a.m. |
+ 1 |
for Comment
oduvan: I contacted with the author of AoC last year, he said I'm not allowed to use his puzzles on CheckiO ...
|
Dec. 13, 2018, 8:12 a.m. |
+ 1 |
for Comment
veky: Well, yeah, I didn't have such generalizations in mind. :-) Yeah, binary compose is something I assu...
|
Dec. 13, 2018, 8:11 a.m. |
+ 1 |
for Comment
veky: Great! Now solve it using `functools.partial`. :-]] I'm not really delighted that much with your_arg...
|
Dec. 13, 2018, 8:11 a.m. |
+ 1 |
for Comment
veky: https://py.checkio.org/mission/brackets/publications/veky/python-3/stack/share/9c7c708aa268a5130b5e5...
|
Dec. 12, 2018, 9:15 a.m. |
+ 1 |
for Comment
kurosawa4434: The input of Extra 1 isn't list.
|
Dec. 9, 2018, 5:12 p.m. |
+ 1 |
for
Second-fed.kz
|