Jan. 21, 2019, 9:39 p.m. |
+2 |
Experience for voted solution didukh_a: 1 on First-Phil15 |
Jan. 21, 2019, 4:48 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: It could be more clear to use tuples of strings. For example, surface = ('LWW', # LAND = 'L'; WATER ... |
Jan. 21, 2019, 1:31 p.m. |
+1 |
Experience for voted solution poooooo: 1 on First-Phil15 |
Jan. 21, 2019, 12:37 p.m. |
+4 |
Experience for voted solution oduvan: 1 on translation dict and zip-Phil15 |
Jan. 19, 2019, 4:35 p.m. |
+5 |
Experience for voted solution svisho1983: 2 on [200th mission] DFS and great neighbors function-Phil15 |
Jan. 19, 2019, 2:35 p.m. |
+3 |
Experience for voted solution arthurdias-trad: 1 on Army with 3 properties : is_alive, warrior, pop-Phil15 |
Jan. 19, 2019, 12:59 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: There is an introductory task [here](https://py.checkio.org/en/mission/multiply-intro/) where there ... |
Jan. 19, 2019, 12:59 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: There are `#` in the input. Ground is a rectangular zone where all `#` are. This mission want you to... |
Jan. 19, 2019, 12:48 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: return True if unit1 is alive, return False if not |
Jan. 19, 2019, 12:48 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: Two types of turns because two types of fight: unit1 vs unit2, army1 vs army2. Here it means between... |
Jan. 19, 2019, 12:47 p.m. |
+5 |
Experience for appreciated comment Sim0000: 1 on Phil15: def beststock(data): max = 0 best_position = None for i in data: if data[i] > max: max = data[i] bes... |
Jan. 19, 2019, 12:47 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: def beststock(data): max = 0 best_position = None for i in data: if data[i] > max: max = data[i] bes... |
Jan. 19, 2019, 12:47 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: You have two variables `a` and `b` and you have to return the product of them. That's all. The all d... |
Jan. 19, 2019, 12:46 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: Good idea to use `count` but use `del` while you loop into the list is not a good idea. Maybe do a l... |
Jan. 19, 2019, 8:14 a.m. |
+13 |
Experience for voted solution veky: 2 on translation dict and zip-Phil15 |
Jan. 18, 2019, 8:09 p.m. |
+1 |
Experience for voted solution CheckDuck: 1 on lambda d: max(d, key=d.get)-Phil15 |
Jan. 18, 2019, 3:09 p.m. |
+5 |
Experience for voted solution Djonny: 3 on re.sub(r'_[a-z]', repl lambda function, name.capitalize())-Phil15 |
Jan. 17, 2019, 4:17 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: @Merzix Pull request (russian translation) merged for signpost and inertia (and sync done). |
Jan. 17, 2019, 1:22 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: Great job (I went to see the great checker and co, clearly not your first mission, this could be goo... |
Jan. 17, 2019, 1:22 p.m. |
+5 |
Experience for appreciated comment oduvan: 1 on Phil15: Great job (I went to see the great checker and co, clearly not your first mission, this could be goo... |
Jan. 17, 2019, 7:37 a.m. |
+1 |
Experience for voted solution Dmitry_Sazhnev: 1 on Non recursive generalization (EAFP style)-Phil15 |
Jan. 16, 2019, 5:52 p.m. |
+20 |
Experience for solved mission Visibilities |
Jan. 16, 2019, 5:51 p.m. |
+20 |
Experience for created mission Visibilities |
Jan. 14, 2019, 7:45 p.m. |
+5 |
Experience for appreciated comment vit.aborigen: 1 on Phil15: Reduce is useful to apply a function to a whole sequence so mult_two = lambda *args: reduce(mul, arg... |
Jan. 14, 2019, 7:45 p.m. |
+1 |
Experience for voted comment vit.aborigen: 1 on Phil15: Reduce is useful to apply a function to a whole sequence so mult_two = lambda *args: reduce(mul, arg... |
Jan. 14, 2019, 1:33 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: It was easy but I liked it. :-) |
Jan. 14, 2019, 1:17 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: Yeah so isometric_strings('foo', 'bar') == False isometric_strings('bar', 'foo') == True Right? |
Jan. 14, 2019, 12:31 p.m. |
+15 |
Experience for solved mission Surjection Strings |
Jan. 14, 2019, 9:06 a.m. |
+1 |
Experience for voted comment Sillte: 1 on Phil15: First, I'm glad you liked it. You probably spent a lot of time on it. There is ROCK, GEMS, MINES, IC... |
Jan. 14, 2019, 9:06 a.m. |
+5 |
Experience for appreciated comment Sillte: 1 on Phil15: First, I'm glad you liked it. You probably spent a lot of time on it. There is ROCK, GEMS, MINES, IC... |
Jan. 14, 2019, 12:06 a.m. |
+3 |
Experience for voted solution Vladimir_Marunin: 3 on First-Phil15 |
Jan. 13, 2019, 8:22 p.m. |
+4 |
Experience for voted solution Tayozhniy: 1 on Ancestor(s?), check last generations-Phil15 |
Jan. 13, 2019, 2:36 p.m. |
+1 |
Experience for voted solution fergothew: 1 on My "min" and "max" built-in functions-Phil15 |
Jan. 13, 2019, 10:40 a.m. |
+1 |
Experience for voted comment przemyslaw.daniel: 1 on Phil15: > I won't translate them all but a few one I hope. |
Jan. 13, 2019, 8:26 a.m. |
+13 |
Experience for voted solution RomanTT: 2 on (Print version) Recursively generate parenthesization on split digits and operations-Phil15 |
Jan. 12, 2019, 3:35 p.m. |
+2 |
Experience for voted solution svisho1983: 1 on list-Phil15 |
Jan. 12, 2019, 2:31 p.m. |
+1 |
Experience for voted solution defendeerofjustice: 1 on First-Phil15 |
Jan. 12, 2019, 10:52 a.m. |
+15 |
Experience for solved mission Signpost |
Jan. 12, 2019, 10:51 a.m. |
+5 |
Experience for appreciated comment kennyufa444: 1 on Phil15: def beststock(data): max = 0 best_position = None for i in data: if data[i] > max: max = data[i] bes... |
Jan. 12, 2019, 10:51 a.m. |
+1 |
Experience for voted comment kennyufa444: 1 on Phil15: def beststock(data): max = 0 best_position = None for i in data: if data[i] > max: max = data[i] bes... |
Jan. 12, 2019, 10:49 a.m. |
+15 |
Experience for created mission Signpost |
Jan. 11, 2019, 3:14 p.m. |
+4 |
Experience for voted solution frbrgeorge: 2 on Compare line[i:i+n] and line[j:j+n] for descending n and possibles (i,j).-Phil15 |
Jan. 11, 2019, 3:06 p.m. |
+20 |
Experience for solved mission Exec Quine |
Jan. 10, 2019, 1:01 p.m. |
+2 |
Experience for voted solution StanislauL: 1 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Jan. 10, 2019, 12:43 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: No, 17 tests, last one is a 50x50 grid. I'm not trying to scare you, I'm only answering the question... |
Jan. 10, 2019, 11:19 a.m. |
+1 |
Experience for voted comment tigerhu3180: 1 on Phil15: I thought about it. This is why there is the first precondition: > You can collect all gems in any p... |
Jan. 10, 2019, 9:33 a.m. |
+1 |
Experience for voted comment Oleg_Domokeev: 1 on Phil15: I thought about it. This is why there is the first precondition: > You can collect all gems in any p... |
Jan. 10, 2019, 8:11 a.m. |
-1 |
Experience for voted solution sashamsuper: -1 on Non recursive generalization (EAFP style)-Phil15 |
Jan. 9, 2019, 10:07 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Yeah angle is the most difficult thing here, I liked find a way to manage it shortly. I used vectors... |
Jan. 9, 2019, 10:07 p.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: Yeah angle is the most difficult thing here, I liked find a way to manage it shortly. I used vectors... |
Jan. 9, 2019, 6:03 p.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: Great job (I went to see the great checker and co, clearly not your first mission, this could be goo... |
Jan. 9, 2019, 6:03 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Great job (I went to see the great checker and co, clearly not your first mission, this could be goo... |
Jan. 9, 2019, 4:06 p.m. |
+7 |
Experience for voted solution Gornostay: 2 on v2: using slicing, sets, generator and translation of punctuation =)-Phil15 |
Jan. 9, 2019, 3:41 p.m. |
+20 |
Experience for solved mission Fortress Cannons |
Jan. 8, 2019, 8:46 p.m. |
+4 |
Experience for voted solution rodka81: 4 on yield from reversed(ascending list)-Phil15 |
Jan. 8, 2019, 3:12 p.m. |
+1 |
Experience for voted comment hongyo: 1 on Phil15: With github (so you need to sign up), you find the repository of the mission and find task_descripti... |
Jan. 8, 2019, 3:12 p.m. |
+5 |
Experience for appreciated comment hongyo: 1 on Phil15: With github (so you need to sign up), you find the repository of the mission and find task_descripti... |
Jan. 8, 2019, 1:35 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: @oduvan @likewind I sent a pull request about it. |
Jan. 8, 2019, 1:02 p.m. |
+5 |
Experience for appreciated comment Tariq_Imtinan: 1 on Phil15: Great you did it. It's a bit ugly (don't take offense). You should look solutions from others. You'l... |
Jan. 8, 2019, 1:02 p.m. |
+1 |
Experience for voted comment Tariq_Imtinan: 1 on Phil15: Great you did it. It's a bit ugly (don't take offense). You should look solutions from others. You'l... |
Jan. 8, 2019, 10:57 a.m. |
+1 |
Experience for voted comment Tariq_Imtinan: 1 on Phil15: Figured it out, vicious. For test == 1, I have after removing zero ['0000', '#000'] The first `for` ... |
Jan. 8, 2019, 10:57 a.m. |
+5 |
Experience for appreciated comment Tariq_Imtinan: 1 on Phil15: Figured it out, vicious. For test == 1, I have after removing zero ['0000', '#000'] The first `for` ... |
Jan. 8, 2019, 9:50 a.m. |
+5 |
Experience for appreciated comment Tariq_Imtinan: 1 on Phil15: Well, there is a problem I saw last time. An exemple: ##0000000000 000000000##0 your list "a" stores... |
Jan. 8, 2019, 9:50 a.m. |
+1 |
Experience for voted comment Tariq_Imtinan: 1 on Phil15: Well, there is a problem I saw last time. An exemple: ##0000000000 000000000##0 your list "a" stores... |
Jan. 8, 2019, 9:44 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: I edited your code a little to understand it better. def longest_palindromic(text): i = 0 length = 0... |
Jan. 8, 2019, 9:42 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: I think it's because it's the second test. I explain: sol = [] at first # do test 1 then sol != [] #... |
Jan. 8, 2019, 9:42 a.m. |
+5 |
Experience for appreciated comment oduvan: 1 on Phil15: I think it's because it's the second test. I explain: sol = [] at first # do test 1 then sol != [] #... |
Jan. 8, 2019, 9:42 a.m. |
+1 |
Experience for voted solution kardosmarton88: 1 on First-Phil15 |
Jan. 8, 2019, 8:57 a.m. |
+1 |
Experience for voted comment Tariq_Imtinan: 1 on Phil15: m = re.search(r"#", i) # it's None so that's why (line 41) print('span') tup = m.span() Your code ca... |
Jan. 8, 2019, 8:57 a.m. |
+5 |
Experience for appreciated comment Tariq_Imtinan: 1 on Phil15: m = re.search(r"#", i) # it's None so that's why (line 41) print('span') tup = m.span() Your code ca... |
Jan. 8, 2019, 6:55 a.m. |
+5 |
Experience for appreciated comment Flamongo: 1 on Phil15: I think it's because it's the second test. I explain: sol = [] at first # do test 1 then sol != [] #... |
Jan. 8, 2019, 6:55 a.m. |
+1 |
Experience for voted comment Flamongo: 1 on Phil15: I think it's because it's the second test. I explain: sol = [] at first # do test 1 then sol != [] #... |
Jan. 7, 2019, 10:17 p.m. |
+5 |
Experience for appreciated comment Tariq_Imtinan: 1 on Phil15: I don't really understand your solution Tariq because it's not readable yet. A bit of cleaning from ... |
Jan. 7, 2019, 10:17 p.m. |
+1 |
Experience for voted comment Tariq_Imtinan: 1 on Phil15: I don't really understand your solution Tariq because it's not readable yet. A bit of cleaning from ... |
Jan. 7, 2019, 7:07 p.m. |
+5 |
Experience for appreciated comment Sim0000: 1 on Phil15: With github (so you need to sign up), you find the repository of the mission and find task_descripti... |
Jan. 7, 2019, 7:07 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: With github (so you need to sign up), you find the repository of the mission and find task_descripti... |
Jan. 7, 2019, 5:57 p.m. |
+1 |
Experience for voted comment Makijoul: 1 on Phil15: I won't tell that all elementary tasks are really "elementary" but there are not challenges either. ... |
Jan. 7, 2019, 10:28 a.m. |
+2 |
Experience for voted solution kardosmarton88: 1 on Counter, re.findall-Phil15 |
Jan. 7, 2019, 4:23 a.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: I won't tell that all elementary tasks are really "elementary" but there are not challenges either. ... |
Jan. 7, 2019, 4:22 a.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: 0##0 0000 #00# The minimal rectangular zone containing all `#` is the entire ground here so an area ... |
Jan. 7, 2019, 12:56 a.m. |
+13 |
Experience for voted solution quarashi: 2 on Ancestor(s?), check last generations-Phil15 |
Jan. 6, 2019, 11:23 p.m. |
+5 |
Experience for appreciated comment BrianMcleod: 1 on Phil15: For info, `next_enemy[int(not i)]` and `next_enemy[not i]` are equivalent. We have list[True] == lis... |
Jan. 6, 2019, 11:23 p.m. |
+1 |
Experience for voted comment BrianMcleod: 1 on Phil15: For info, `next_enemy[int(not i)]` and `next_enemy[not i]` are equivalent. We have list[True] == lis... |
Jan. 6, 2019, 8 p.m. |
+1 |
Experience for voted solution frankiser: 1 on Replace ',' and '.' by ' ', one split and it's over.-Phil15 |
Jan. 5, 2019, 4:02 p.m. |
+60 |
Experience for solved mission Express Delivery |
Jan. 5, 2019, 9:52 a.m. |
+30 |
Experience for solved mission Snake Lite |
Jan. 4, 2019, 3:23 p.m. |
+5 |
Experience for appreciated comment Sim0000: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 4, 2019, 3:23 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: Happy New Year 2019 to the whole CheckiO community! I learned a lot thanks to you all! |
Jan. 4, 2019, 1:02 p.m. |
+2 |
Experience for voted solution kirosx88: 2 on First-Phil15 |
Jan. 4, 2019, 12:49 a.m. |
+5 |
Experience for appreciated comment johan4622: 1 on Phil15: You can write `if matrix[i][i]:` instead of `if matrix[i][i] != 0:`. It's a python thing. Don't see ... |
Jan. 4, 2019, 12:49 a.m. |
+2 |
Experience for voted comment johan4622: 1 on Phil15: You can write `if matrix[i][i]:` instead of `if matrix[i][i] != 0:`. It's a python thing. Don't see ... |
Jan. 3, 2019, 11:07 p.m. |
+24 |
Experience for voted solution vit.aborigen: 5 on 6-liner relatively clear/creative-Phil15 |
Jan. 3, 2019, 3:43 p.m. |
+5 |
Experience for appreciated comment swagg010164: 1 on Phil15: Well numpy is good but it's more for "3rd party" category. def checkio(matrix): a = np.array(matrix)... |
Jan. 3, 2019, 3:43 p.m. |
+2 |
Experience for voted comment swagg010164: 1 on Phil15: Well numpy is good but it's more for "3rd party" category. def checkio(matrix): a = np.array(matrix)... |
Jan. 3, 2019, 3:21 p.m. |
+2 |
Experience for voted solution ThibautPayen: 2 on Sum comprehension in lambda function-Phil15 |
Jan. 3, 2019, 10:20 a.m. |
+2 |
Experience for voted solution svisho1983: 1 on Simply my speech module-Phil15 |
Jan. 3, 2019, 9:32 a.m. |
+13 |
Experience for voted solution tigerhu3180: 2 on next(filter(balance, indexes), -1)-Phil15 |
Jan. 2, 2019, 10:02 p.m. |
-1 |
Experience for voted solution thealfest1: -1 on two solutions-Phil15 |
Jan. 2, 2019, 8:58 p.m. |
+7 |
Experience for voted solution BrianMcleod: 1 on Distance in one hexagonal coordinate system-Phil15 |
Jan. 2, 2019, 2:11 p.m. |
+1 |
Experience for voted comment Merzix: 1 on Phil15: I agree it's awful ^^. I tried some improvements. Happy new coding year! from math import ceil def a... |