Jan. 2, 2019, 2:11 p.m. |
+5 |
Experience for appreciated comment Merzix: 1 on Phil15: I agree it's awful ^^. I tried some improvements. Happy new coding year! from math import ceil def a... |
Jan. 2, 2019, 12:59 p.m. |
+5 |
Experience for appreciated comment vit.aborigen: 1 on Phil15: line 32: folders = folders[:-1] # you do an entire copy of the list # or folders.pop() # just pop la... |
Jan. 2, 2019, 12:59 p.m. |
+1 |
Experience for voted comment vit.aborigen: 1 on Phil15: line 32: folders = folders[:-1] # you do an entire copy of the list # or folders.pop() # just pop la... |
Jan. 2, 2019, 12:53 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 2, 2019, 12:53 p.m. |
+5 |
Experience for appreciated comment oduvan: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 2, 2019, 11:20 a.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 2, 2019, 11:20 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 2, 2019, 10:13 a.m. |
+1 |
Experience for voted comment fed.kz: 1 on Phil15: Like it but an iterable is enough. :D def checkio(array): for number in array: try: array.index(numb... |
Jan. 2, 2019, 10:13 a.m. |
+5 |
Experience for appreciated comment fed.kz: 1 on Phil15: Like it but an iterable is enough. :D def checkio(array): for number in array: try: array.index(numb... |
Jan. 2, 2019, 1:47 a.m. |
+1 |
Experience for voted solution gsm1020: 1 on Non recursive generalization (EAFP style)-Phil15 |
Jan. 1, 2019, 7:02 p.m. |
+4 |
Experience for voted solution timqsh: 2 on 1-liner: array[bool][bool]-Phil15 |
Jan. 1, 2019, 6:40 p.m. |
+5 |
Experience for appreciated comment Merzix: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 1, 2019, 6:40 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 1, 2019, 12:55 p.m. |
+5 |
Experience for appreciated comment Tinus_Trotyl: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 1, 2019, 12:55 p.m. |
+1 |
Experience for voted comment Tinus_Trotyl: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 1, 2019, 10:55 a.m. |
+1 |
Experience for voted comment przemyslaw.daniel: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 1, 2019, 10:55 a.m. |
+5 |
Experience for appreciated comment przemyslaw.daniel: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 1, 2019, 7:52 a.m. |
+4 |
Experience for voted solution fokusd: 2 on First-Phil15 |
Dec. 31, 2018, 2:08 p.m. |
+5 |
Experience for appreciated comment Sillte: 1 on Phil15: I also use print to know things. But I return my result anyway. For example, the code above, I would... |
Dec. 31, 2018, 2:08 p.m. |
+1 |
Experience for voted comment Sillte: 1 on Phil15: I also use print to know things. But I return my result anyway. For example, the code above, I would... |
Dec. 31, 2018, 12:10 a.m. |
+5 |
Experience for appreciated comment Joe_Salmans: 1 on Phil15: I also use print to know things. But I return my result anyway. For example, the code above, I would... |
Dec. 31, 2018, 12:10 a.m. |
+1 |
Experience for voted comment Joe_Salmans: 1 on Phil15: I also use print to know things. But I return my result anyway. For example, the code above, I would... |
Dec. 30, 2018, 12:12 p.m. |
+1 |
Experience for voted solution anatoliy.bilenko: 1 on lambda d: max(d, key=d.get)-Phil15 |
Dec. 29, 2018, 10:36 p.m. |
-1 |
Experience for voted solution anatoliy.bilenko: -1 on Non recursive generalization (EAFP style)-Phil15 |
Dec. 29, 2018, 9:40 p.m. |
+2 |
Experience for voted solution s1tta: 1 on First-Phil15 |
Dec. 29, 2018, 2:42 p.m. |
+5 |
Experience for voted solution Polladin: 2 on First-Phil15 |
Dec. 29, 2018, 9:43 a.m. |
+13 |
Experience for voted solution jiangyuebing: 2 on My healers-Phil15 |
Dec. 29, 2018, 4:31 a.m. |
+2 |
Experience for voted solution Joe_Salmans: 1 on Non recursive generalization (EAFP style)-Phil15 |
Dec. 28, 2018, 12:27 p.m. |
+7 |
Experience for voted solution niilz: 3 on v2 (from flpo veky and myself): Party(Named, set), Friends(str) with lambda show_invite-Phil15 |
Dec. 27, 2018, 1:47 p.m. |
+15 |
Experience for created mission Light Up |
Dec. 27, 2018, 7:38 a.m. |
+7 |
Experience for voted solution tigerhu3180: 2 on min(routes generator, key=len)-Phil15 |
Dec. 26, 2018, 4:13 p.m. |
+3 |
Experience for voted solution BornForDying: 3 on two solutions-Phil15 |
Dec. 26, 2018, 2:26 p.m. |
+3 |
Experience for voted solution BornForDying: 3 on lambda d: max(d, key=d.get)-Phil15 |
Dec. 26, 2018, 7:07 a.m. |
+13 |
Experience for voted solution tigerhu3180: 2 on @join(',') on generator with Counter-Phil15 |
Dec. 25, 2018, 1:25 p.m. |
+1 |
Experience for voted comment RomanTT: 1 on Phil15: Binary it's numbers written only with 0 and 1. So 2 symbols. Decimal it's numbers written with 0,1,2... |
Dec. 25, 2018, 12:15 p.m. |
+8 |
Experience for voted solution cmakr: 2 on First-Phil15 |
Dec. 24, 2018, 2:02 p.m. |
+6 |
Experience for voted solution Elemenope: 1 on With chain rows/cols/diags generators-Phil15 |
Dec. 23, 2018, 9:55 p.m. |
+33 |
Experience for voted solution Tinus_Trotyl: 5 on Look for sure things thanks to comparisons-Phil15 |
Dec. 23, 2018, 10:05 a.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: There not but there at even indexes. (array[0] + array[2] + ...) * 'last element of array' |
Dec. 22, 2018, 5:26 p.m. |
+8 |
Experience for solved mission Inertia |
Dec. 22, 2018, 5:25 p.m. |
+8 |
Experience for created mission Inertia |
Dec. 22, 2018, 11:04 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Well, it's a bit visible on the repository in the file `tests.py`. The game from Simon Tatham's Puzz... |
Dec. 21, 2018, 11:38 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: @oduvan We have a problem like with @BrianMcleod recently. |
Dec. 21, 2018, 5:06 a.m. |
+1 |
Experience for voted comment fed.kz: 1 on Phil15: I suppose you mean that (indentation have an important meaning). I add comments for explanations. Yo... |
Dec. 21, 2018, 3 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Rather my turn to thank you. |
Dec. 20, 2018, 1:51 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Pull request merged and repository synced with checkio, you can look it. |
Dec. 20, 2018, 1:30 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Like it :-) But it may be slow with the last and big test 25x40. |
Dec. 20, 2018, 11:36 a.m. |
+1 |
Experience for voted comment veky: 1 on Phil15: Well, I thought about composition by myself first (after all, when I wrote `func(f(*args, **kwargs))... |
Dec. 20, 2018, 8 a.m. |
+8 |
Experience for voted solution frbrgeorge: 2 on try except-Phil15 |
Dec. 20, 2018, 3:47 a.m. |
+6 |
Experience for voted solution nb14162: 1 on First-Phil15 |
Dec. 19, 2018, 5:06 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Thanks for your message! I suppose you are the one who has solved it, great! :-D I started to solve ... |
Dec. 19, 2018, noon |
+13 |
Experience for voted solution spanring: 2 on DFS on colored (integers) net without crashes, return max color int-Phil15 |
Dec. 19, 2018, 8:15 a.m. |
+2 |
Experience for voted solution alexandrov.net: 1 on Simple generator of characters (decorated to ''.join output)-Phil15 |
Dec. 19, 2018, 6:46 a.m. |
+2 |
Experience for voted solution archius11: 2 on Sets of friends-Phil15 |
Dec. 18, 2018, 6:02 p.m. |
+2 |
Experience for voted solution fed.kz: 1 on Simple generator of characters (decorated to ''.join output)-Phil15 |
Dec. 18, 2018, 1:34 p.m. |
+15 |
Experience for solved mission Net Game |
Dec. 18, 2018, 12:28 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: My logo doesn't appear for me, any idea why? I took an old checkio logo and made changes with inksca... |
Dec. 18, 2018, 9:04 a.m. |
+3 |
Experience for voted solution acarpioanon: 3 on lambda-Phil15 |
Dec. 17, 2018, 4:27 p.m. |
+15 |
Experience for created mission Net Game |
Dec. 17, 2018, 3:04 p.m. |
+1 |
Experience for voted comment Kuznetsov_Mihail: 1 on Phil15: lambda x: (-x[1], x[0]) else it's two separated by a comma. Like I say below (we wrote message at th... |
Dec. 17, 2018, 3:04 p.m. |
+5 |
Experience for appreciated comment Kuznetsov_Mihail: 1 on Phil15: lambda x: (-x[1], x[0]) else it's two separated by a comma. Like I say below (we wrote message at th... |
Dec. 17, 2018, 3:04 p.m. |
+5 |
Experience for appreciated comment Kuznetsov_Mihail: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 17, 2018, 3:04 p.m. |
+1 |
Experience for voted comment Kuznetsov_Mihail: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 17, 2018, 2:56 p.m. |
+1 |
Experience for voted comment Kuznetsov_Mihail: 1 on Phil15: `most_common(1)` just keep the first, it's not what you need in each case so just `most_common()`. s... |
Dec. 17, 2018, 2:56 p.m. |
+5 |
Experience for appreciated comment Kuznetsov_Mihail: 1 on Phil15: `most_common(1)` just keep the first, it's not what you need in each case so just `most_common()`. s... |
Dec. 17, 2018, 2:12 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: `most_common(1)` just keep the first, it's not what you need in each case so just `most_common()`. s... |
Dec. 17, 2018, 2:12 p.m. |
+5 |
Experience for appreciated comment Merzix: 1 on Phil15: `most_common(1)` just keep the first, it's not what you need in each case so just `most_common()`. s... |
Dec. 17, 2018, 1:34 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: Ah... checkio really do the link when we write the url repository in the mission manager. Ok I can s... |
Dec. 17, 2018, 11:01 a.m. |
+3 |
Experience for voted solution roncitrus: 2 on 1-liner: join and replace-Phil15 |
Dec. 17, 2018, 10:28 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: Ok so I delete that one and create another without passphrase? |
Dec. 17, 2018, 9:34 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: Well, new traceback I don't understand. |
Dec. 17, 2018, 8:01 a.m. |
+5 |
Experience for appreciated comment raDom: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 17, 2018, 8:01 a.m. |
+1 |
Experience for voted comment raDom: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 16, 2018, 4:27 p.m. |
+4 |
Experience for voted solution svisho1983: 1 on v2: using slicing, sets, generator and translation of punctuation =)-Phil15 |
Dec. 16, 2018, 3:48 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: Well, "new" mission solved. :-) checkio = lambda n: 2 * old_checkio(n) if n else float('infinity') I... |
Dec. 15, 2018, 4:29 p.m. |
+2 |
Experience for voted solution alanj.harris14: 2 on two solutions-Phil15 |
Dec. 15, 2018, 2:24 p.m. |
+1 |
Experience for voted comment Morph: 1 on Phil15: def checkio(words: str) -> bool: count = 0 wordlist = words.split() for word in wordlist: if word.is... |
Dec. 15, 2018, 2:24 p.m. |
+5 |
Experience for appreciated comment Morph: 1 on Phil15: def checkio(words: str) -> bool: count = 0 wordlist = words.split() for word in wordlist: if word.is... |
Dec. 15, 2018, 11:55 a.m. |
+1 |
Experience for voted comment colinmcnicholl: 1 on Phil15: There is also the "comprehension thing": n for start, stop in items for n in range(start, stop + 1) |
Dec. 15, 2018, 11:55 a.m. |
+5 |
Experience for appreciated comment colinmcnicholl: 1 on 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. |
+5 |
Experience for appreciated comment colinmcnicholl: 1 on Phil15: I started to think I would not see `list.extend(range(...))`. But you can unpack tuples from items b... |
Dec. 15, 2018, 11:37 a.m. |
+2 |
Experience for voted comment colinmcnicholl: 1 on Phil15: I started to think I would not see `list.extend(range(...))`. But you can unpack tuples from items b... |
Dec. 15, 2018, 7:30 a.m. |
+5 |
Experience for appreciated comment Merzix: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 15, 2018, 7:30 a.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: First, if you use counter, you can use the method `most_common`. Second, your code don't consider th... |
Dec. 14, 2018, 9:49 p.m. |
+2 |
Experience for voted solution Pavel_Osipenko: 1 on 1-liner: join and replace-Phil15 |
Dec. 14, 2018, 9:24 a.m. |
+5 |
Experience for voted solution eugene100372: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Dec. 14, 2018, 7:25 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: "lol" appears then 1 (no matter how many times it appears) "olo" appears then 1 total of given words... |
Dec. 13, 2018, 4:15 a.m. |
+1 |
Experience for voted comment veky: 1 on Phil15: Yeah, I saw it. I'm happy you didn't tell me to make it with `functools.partial` at first because I ... |
Dec. 13, 2018, 4:15 a.m. |
+5 |
Experience for appreciated comment veky: 1 on Phil15: Yeah, I saw it. I'm happy you didn't tell me to make it with `functools.partial` at first because I ... |
Dec. 13, 2018, 4:15 a.m. |
+5 |
Experience for appreciated comment veky: 1 on Phil15: It's about "composition of functions" so I don't see how to solve it (no matter how partial is aweso... |
Dec. 13, 2018, 4:15 a.m. |
+1 |
Experience for voted comment veky: 1 on Phil15: It's about "composition of functions" so I don't see how to solve it (no matter how partial is aweso... |
Dec. 12, 2018, 6:12 p.m. |
+8 |
Experience for voted solution fed.kz: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Dec. 12, 2018, 3:22 p.m. |
+3 |
Experience for voted solution vmiimu: 3 on yield from reversed(ascending list)-Phil15 |
Dec. 12, 2018, 12:43 p.m. |
+2 |
Experience for voted comment Sillte: 1 on Phil15: Just `median` is also ok :-) |
Dec. 12, 2018, 12:43 p.m. |
+5 |
Experience for appreciated comment Sillte: 1 on Phil15: Just `median` is also ok :-) |
Dec. 12, 2018, 10:22 a.m. |
+15 |
Experience for solved mission Expand Intervals |
Dec. 12, 2018, 9:36 a.m. |
+8 |
Experience for solved mission Caps Lock |
Dec. 12, 2018, 9:14 a.m. |
+15 |
Experience for solved mission Can Balance |
Dec. 11, 2018, 9:19 p.m. |
+2 |
Experience for voted comment suic: 1 on Phil15: I did use yield from too but I prefered `yield from reversed(run)` to slicing making a copy. I quibb... |
Dec. 11, 2018, 9:19 p.m. |
+5 |
Experience for appreciated comment suic: 1 on Phil15: I did use yield from too but I prefered `yield from reversed(run)` to slicing making a copy. I quibb... |