Nov. 5, 2019, 3:54 p.m. |
+2 |
Experience for voted solution seleneyue: 2 on import it-Phil15 |
Nov. 5, 2019, 1:11 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: **Army 1 have the advantage to always start a fight. So here, even if it's tricky, army 1 wins even ... |
Nov. 4, 2019, 4:52 p.m. |
+1 |
Experience for voted comment Natalia99: 1 on Phil15: Thanks, it's an old code but I don't use `list.remove` method usually but it's appropriate here. I w... |
Nov. 1, 2019, 4:10 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: class Warrior: def __init__(self): self.health=50 self.attack=5 # .is_alive, not .is_alive() # so in... |
Oct. 31, 2019, 7:51 p.m. |
+7 |
Experience for voted solution yarmak_vladislav: 1 on First-Phil15 |
Oct. 31, 2019, 8:28 a.m. |
+1 |
Experience for voted solution antonyur87: 1 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Oct. 31, 2019, 7:29 a.m. |
+7 |
Experience for voted solution ludek.reif: 3 on with re.findall and generators-Phil15 |
Oct. 30, 2019, 8:07 p.m. |
+2 |
Experience for voted solution bemaxradio: 1 on lambda and math upper bound-Phil15 |
Oct. 30, 2019, 8:04 p.m. |
+2 |
Experience for voted solution bemaxradio: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Oct. 29, 2019, 11:44 p.m. |
+5 |
Experience for appreciated comment Nai-chan: 1 on Phil15: In the python editor, you click on "Check" to test your solution. If you pass the tests, two buttons... |
Oct. 29, 2019, 11:44 p.m. |
+1 |
Experience for voted comment Nai-chan: 1 on Phil15: In the python editor, you click on "Check" to test your solution. If you pass the tests, two buttons... |
Oct. 29, 2019, 1:48 p.m. |
+5 |
Experience for appreciated comment tj_spark: 1 on Phil15: items = [ x for x in items if x is not item ] ~~~~~~ items = [ x for x in items if x != item ] `is` ... |
Oct. 29, 2019, 1:48 p.m. |
+1 |
Experience for voted comment tj_spark: 1 on Phil15: items = [ x for x in items if x is not item ] ~~~~~~ items = [ x for x in items if x != item ] `is` ... |
Oct. 28, 2019, 7:14 p.m. |
+5 |
Experience for appreciated comment imtiaz.rahi: 1 on Phil15: @oduvan Bug here! |
Oct. 28, 2019, 7:14 p.m. |
+1 |
Experience for voted comment imtiaz.rahi: 1 on Phil15: @oduvan Bug here! |
Oct. 28, 2019, 6:47 p.m. |
+10 |
Experience for voted solution Natalia99: 2 on Be lenient, it's my first class ever-Phil15 |
Oct. 27, 2019, 3:37 p.m. |
-1 |
Experience for voted solution lidong6: -1 on Army with 3 properties : is_alive, warrior, pop-Phil15 |
Oct. 27, 2019, 4:39 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: items = [ x for x in items if x is not item ] ~~~~~~ items = [ x for x in items if x != item ] `is` ... |
Oct. 27, 2019, 4:39 a.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: items = [ x for x in items if x is not item ] ~~~~~~ items = [ x for x in items if x != item ] `is` ... |
Oct. 26, 2019, 6:24 p.m. |
+1 |
Experience for voted solution fatmakyba: 1 on My "long repeat inside" program-Phil15 |
Oct. 26, 2019, 6:23 p.m. |
+2 |
Experience for voted solution danersow: 2 on DFS on colored network graph without crashed nodes-Phil15 |
Oct. 26, 2019, 9:45 a.m. |
+1 |
Experience for voted comment colinmcnicholl: 1 on Phil15: I didn't know difficulty depend on the island too, at first. Dynamic programming is about this thing... |
Oct. 26, 2019, 9:45 a.m. |
+5 |
Experience for appreciated comment colinmcnicholl: 1 on 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 |
Experience for voted comment colinmcnicholl: 1 on Phil15: First, it's "elementary" for the hubspot island, which is a difficult island, so not really elementa... |
Oct. 25, 2019, 8:15 a.m. |
+5 |
Experience for appreciated comment colinmcnicholl: 1 on Phil15: First, it's "elementary" for the hubspot island, which is a difficult island, so not really elementa... |
Oct. 25, 2019, 7:42 a.m. |
+1 |
Experience for voted solution takooo: 1 on Dijkstra with priority queue-Phil15 |
Oct. 23, 2019, 11:02 p.m. |
+2 |
Experience for voted solution lidong6: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Oct. 23, 2019, 11:07 a.m. |
+1 |
Experience for voted comment imtiaz.rahi: 1 on Phil15: Well, I have the same issue, links are about the last user of the follower column (here "Anton_Emets... |
Oct. 23, 2019, 11:07 a.m. |
+5 |
Experience for appreciated comment imtiaz.rahi: 1 on Phil15: Well, I have the same issue, links are about the last user of the follower column (here "Anton_Emets... |
Oct. 22, 2019, 6:19 a.m. |
+3 |
Experience for voted solution stonegz: 3 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Oct. 21, 2019, 2 p.m. |
-2 |
Experience for voted solution Misha1234: -1 on import it-Phil15 |
Oct. 16, 2019, 6:13 p.m. |
+1 |
Experience for voted solution LintuStorm_a8334ed4883e45b9980: 1 on My "min" and "max" built-in functions-Phil15 |
Oct. 16, 2019, 4:33 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: Well, like you said, the mission had an update. Unless github repository is not synced, which it is ... |
Oct. 16, 2019, 4:04 p.m. |
+5 |
Experience for appreciated comment vnkvstnk: 1 on Phil15: Simply, `yield` is two things: it gives an object, and it is a pause in code execution. def f(n): fo... |
Oct. 16, 2019, 4:04 p.m. |
+1 |
Experience for voted comment vnkvstnk: 1 on Phil15: Simply, `yield` is two things: it gives an object, and it is a pause in code execution. def f(n): fo... |
Oct. 15, 2019, 5:20 p.m. |
+5 |
Experience for appreciated comment vnkvstnk: 1 on Phil15: _My thoughts, in the order that they came to me..._ Main difference is about if vertex == goal: yiel... |
Oct. 15, 2019, 5:20 p.m. |
+1 |
Experience for voted comment vnkvstnk: 1 on Phil15: _My thoughts, in the order that they came to me..._ Main difference is about if vertex == goal: yiel... |
Oct. 15, 2019, 7:47 a.m. |
+5 |
Experience for appreciated comment imtiaz.rahi: 1 on Phil15: Solved it. I liked it and its JS animation. I guess the animation could be even clearer with multipl... |
Oct. 15, 2019, 7:47 a.m. |
+1 |
Experience for voted comment imtiaz.rahi: 1 on Phil15: Solved it. I liked it and its JS animation. I guess the animation could be even clearer with multipl... |
Oct. 14, 2019, 4:29 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: In `[4,6,2,2,2,6,4,4,4]`, 2 appears three times, 6 appears only two times so 2s have to be before 6s... |
Oct. 14, 2019, 3:49 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: [5] -> 5 [5, 2] -> 2 [5, 2, 9] -> 5 [2, 9, 1] -> 2 [9, 1, 7] -> 7 [1, 7, 4] -> 4 [7, 4, 6] -> 6 [4, ... |
Oct. 14, 2019, 10:39 a.m. |
+1 |
Experience for voted solution metravs: 1 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Oct. 13, 2019, 2:22 p.m. |
+7 |
Experience for voted solution imtiaz.rahi: 2 on Robot = Human(str)-Phil15 |
Oct. 12, 2019, 1:52 p.m. |
+8 |
Experience for voted solution Sioul: 2 on try iterate from it except TypeError-Phil15 |
Oct. 12, 2019, 8:51 a.m. |
+2 |
Experience for voted solution kudinov.feodor: 2 on lambda-Phil15 |
Oct. 10, 2019, 12:38 p.m. |
+5 |
Experience for appreciated comment oduvan: 1 on Phil15: Well, it doesn't manage all cases. [This](https://py.checkio.org/forum/post/13361/wall_keeper-tests-... |
Oct. 10, 2019, 12:38 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: Well, it doesn't manage all cases. [This](https://py.checkio.org/forum/post/13361/wall_keeper-tests-... |
Oct. 10, 2019, 5:41 a.m. |
+7 |
Experience for voted solution Taki0423: 1 on [py3.8+] 1-liner: 117 chars-Phil15 |
Oct. 9, 2019, 8:42 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: My first guess, it's about powerset: you don't need to list all things, since you just need to itera... |
Oct. 9, 2019, 6:41 a.m. |
+1 |
Experience for voted solution leavitskiy: 1 on Army with 3 properties : is_alive, warrior, pop-Phil15 |
Oct. 9, 2019, 3:23 a.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: I didn't any idea of what you are talking about without a quick search on google. It's about databas... |
Oct. 8, 2019, 5:54 a.m. |
+1 |
Experience for voted solution pokosasa: 1 on Army with 3 properties : is_alive, warrior, pop-Phil15 |
Oct. 7, 2019, 10:52 p.m. |
+3 |
Experience for voted solution Chnelik_Sebastian: 1 on [4th version] fast (and limited memory)-Phil15 |
Oct. 3, 2019, 8:01 p.m. |
+5 |
Experience for appreciated comment RaymondW_0b0cf70290cd4850b9f57: 1 on Phil15: You can't return a numpy object (yet, maybe ever). `return d.tolist()` should work for all numpy obj... |
Oct. 3, 2019, 8:01 p.m. |
+1 |
Experience for voted comment RaymondW_0b0cf70290cd4850b9f57: 1 on Phil15: You can't return a numpy object (yet, maybe ever). `return d.tolist()` should work for all numpy obj... |
Oct. 1, 2019, 11:47 a.m. |
+2 |
Experience for voted solution huynhphillip57: 1 on import it-Phil15 |
Sept. 30, 2019, 5:51 a.m. |
+1 |
Experience for voted comment przemyslaw.daniel: 1 on Phil15: I understand why you named it like this, but I would have called it "N-th permutation", it's clearer... |
Sept. 30, 2019, 5:51 a.m. |
+5 |
Experience for appreciated comment przemyslaw.daniel: 1 on Phil15: I understand why you named it like this, but I would have called it "N-th permutation", it's clearer... |
Sept. 30, 2019, 3:43 a.m. |
+4 |
Experience for voted solution Tiango: 2 on basic 1-liner-Phil15 |
Sept. 29, 2019, 11:58 a.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: I understand why you named it like this, but I would have called it "N-th permutation", it's clearer... |
Sept. 29, 2019, 11:58 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: I understand why you named it like this, but I would have called it "N-th permutation", it's clearer... |
Sept. 28, 2019, 7:48 p.m. |
+15 |
Experience for solved mission Reversed Permutation Index |
Sept. 28, 2019, 11:37 a.m. |
+13 |
Experience for voted solution johankor: 2 on Man, I can find hidden words in poetry! :-)-Phil15 |
Sept. 27, 2019, 11:19 p.m. |
+15 |
Experience for solved mission Permutation Index |
Sept. 27, 2019, 7:14 p.m. |
+2 |
Experience for voted solution kudinov.feodor: 2 on operator.itemgetter-Phil15 |
Sept. 27, 2019, 4:30 p.m. |
+1 |
Experience for voted solution FirstShanti: 1 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Sept. 26, 2019, 7:49 p.m. |
+5 |
Experience for appreciated comment oldjaponec: 1 on Phil15: for i in range(y, 1, -1): # instead of i=y while i>1: ... i-=1 and it's weird, you don't really use ... |
Sept. 26, 2019, 7:49 p.m. |
+1 |
Experience for voted comment oldjaponec: 1 on Phil15: for i in range(y, 1, -1): # instead of i=y while i>1: ... i-=1 and it's weird, you don't really use ... |
Sept. 26, 2019, 7:27 p.m. |
+2 |
Experience for voted solution Chnelik_Sebastian: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Sept. 26, 2019, 7:27 p.m. |
+1 |
Experience for voted comment Chnelik_Sebastian: 1 on Phil15: What's next is totally equivalent to the next line, so you compute the entire list before to take th... |
Sept. 26, 2019, 2:57 p.m. |
+3 |
Experience for voted solution tofguerrier: 3 on lambda-Phil15 |
Sept. 26, 2019, 2:39 p.m. |
+5 |
Experience for appreciated comment oldjaponec: 1 on Phil15: Sets are unordered collections, so iterate on them is kind of random, and since there is no only one... |
Sept. 26, 2019, 2:39 p.m. |
+1 |
Experience for voted comment oldjaponec: 1 on Phil15: Sets are unordered collections, so iterate on them is kind of random, and since there is no only one... |
Sept. 25, 2019, 8:50 a.m. |
+1 |
Experience for voted comment oldjaponec: 1 on Phil15: Ah yeah indeed, you can't use `fight` function in `fight` method since you need to heal at each hit. |
Sept. 25, 2019, 8:50 a.m. |
+5 |
Experience for appreciated comment oldjaponec: 1 on Phil15: Ah yeah indeed, you can't use `fight` function in `fight` method since you need to heal at each hit. |
Sept. 25, 2019, 8:42 a.m. |
+5 |
Experience for appreciated comment oldjaponec: 1 on Phil15: For example, you can put an heal method in Healer class. Then in fight method, check if `len(army.un... |
Sept. 25, 2019, 8:42 a.m. |
+1 |
Experience for voted comment oldjaponec: 1 on Phil15: For example, you can put an heal method in Healer class. Then in fight method, check if `len(army.un... |
Sept. 24, 2019, 5:47 p.m. |
+4 |
Experience for voted solution Matvey127: 4 on Buttons generator (with DFS) and a reverse_sorting decorator-Phil15 |
Sept. 24, 2019, 12:45 p.m. |
-1 |
Experience for voted solution kazimsenocak_7a38c2e751dc44f79: -1 on First-Phil15 |
Sept. 24, 2019, 6:41 a.m. |
+8 |
Experience for voted solution HeNeArKr: 2 on 21-liner: Dynamic programming to get scopes, heapq to minimize unsupplied cities-Phil15 |
Sept. 24, 2019, 5:06 a.m. |
+2 |
Experience for voted solution latencytr: 2 on [v2] enumerate, try line.index, max(..., key=len)-Phil15 |
Sept. 23, 2019, 5:55 p.m. |
+4 |
Experience for voted solution eugenga: 2 on itertools.groupby to group consecutives, sum to sum-Phil15 |
Sept. 23, 2019, 5:35 a.m. |
+6 |
Experience for voted solution obone: 1 on Proud of my math skills to prove that ^^-Phil15 |
Sept. 20, 2019, 12:23 p.m. |
+1 |
Experience for voted solution taizo_python: 1 on 1-liner: array[bool][bool]-Phil15 |
Sept. 20, 2019, 12:03 p.m. |
+1 |
Experience for voted solution Sioul: 1 on Army with 3 properties : is_alive, warrior, pop-Phil15 |
Sept. 18, 2019, 10:45 a.m. |
-1 |
Experience for voted comment universalamateur: -1 on Phil15: assert probability(10, 10, 50) == 0.0375 `10**10==10000000000` cases seems a bit too big: bruteforce... |
Sept. 18, 2019, 8:12 a.m. |
+7 |
Experience for voted solution wu.yue.0292_353dd5fe744d40f098: 3 on Compute volume and area of a spheroid-Phil15 |
Sept. 16, 2019, 7:33 p.m. |
+1 |
Experience for voted comment przemyslaw.daniel: 1 on Phil15: Amazing job as always. Solved and liked it. |
Sept. 16, 2019, 7:33 p.m. |
+5 |
Experience for appreciated comment przemyslaw.daniel: 1 on Phil15: Amazing job as always. Solved and liked it. |
Sept. 15, 2019, 9:49 a.m. |
+1 |
Experience for voted comment genadiik: 1 on Phil15: First I suppose your code is (indent your code in order for the forum to know it's code) def checkio... |
Sept. 14, 2019, 6:46 p.m. |
+2 |
Experience for voted solution Matvey127: 2 on sum bool-Phil15 |
Sept. 14, 2019, 3:49 p.m. |
+5 |
Experience for appreciated comment oduvan: 1 on Phil15: @oduvan Maybe we should add a point in the post of [the most common mistakes](https://py.checkio.org... |
Sept. 14, 2019, 3:49 p.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: @oduvan Maybe we should add a point in the post of [the most common mistakes](https://py.checkio.org... |
Sept. 14, 2019, 12:11 p.m. |
+1 |
Experience for voted comment bsquare: 1 on Phil15: Yeah I didn't read enough. But still useful to know this `tolist` method. |
Sept. 14, 2019, 12:11 p.m. |
+5 |
Experience for appreciated comment bsquare: 1 on Phil15: Yeah I didn't read enough. But still useful to know this `tolist` method. |
Sept. 14, 2019, 10:55 a.m. |
+5 |
Experience for appreciated comment bsquare: 1 on Phil15: @oduvan Maybe we should add a point in the post of [the most common mistakes](https://py.checkio.org... |
Sept. 14, 2019, 10:55 a.m. |
+1 |
Experience for voted comment bsquare: 1 on Phil15: @oduvan Maybe we should add a point in the post of [the most common mistakes](https://py.checkio.org... |
Sept. 13, 2019, 9:33 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: `self.health > 0` is already a boolean True or False, so return it: `return self.health > 0`. Nearly... |
Sept. 9, 2019, 6:48 p.m. |
+3 |
Experience for voted solution ibson: 3 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Sept. 9, 2019, 5:51 p.m. |
+1 |
Experience for voted comment oldjaponec: 1 on Phil15: The defender can not have 76 points of life. He decreased by 2 the hit of the rookie (attack=1), but... |