Jan. 14, 2020, 4:26 p.m. |
+5 |
Experience for appreciated comment joecat: 1 on Phil15: If I vote +1 on your forum post, or any message you wrote, you will get 1 leaderbord point. But the ... |
Jan. 12, 2020, 8:23 p.m. |
+4 |
Experience for voted solution Niko71: 2 on try iterate from it except TypeError-Phil15 |
Jan. 12, 2020, 4:48 p.m. |
+1 |
Experience for voted solution scanover: 1 on sets and sum of bools-Phil15 |
Jan. 12, 2020, 9:22 a.m. |
+8 |
Experience for solved mission Majority |
Jan. 12, 2020, 9:21 a.m. |
+15 |
Experience for solved mission Sort Except Zero |
Jan. 12, 2020, 9:04 a.m. |
+8 |
Experience for solved mission Chunk |
Jan. 12, 2020, 8:58 a.m. |
+8 |
Experience for solved mission Compress List |
Jan. 12, 2020, 8:41 a.m. |
+5 |
Experience for solved mission Remove All After |
Jan. 12, 2020, 8:37 a.m. |
+5 |
Experience for solved mission Remove All Before |
Jan. 11, 2020, 10:14 a.m. |
+5 |
Experience for solved mission Replace Last |
Jan. 11, 2020, 8:55 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: When I imagine this island, I see a **Mayan pyramid floating in water or space**, humbly named **Tem... |
Jan. 10, 2020, 9:18 p.m. |
+5 |
Experience for appreciated comment delapi: 1 on Phil15: For readability purpose, it's equivalent to: def between_markers(a, b, c): if c in a: return a[a.fin... |
Jan. 10, 2020, 9:18 p.m. |
+1 |
Experience for voted comment delapi: 1 on Phil15: For readability purpose, it's equivalent to: def between_markers(a, b, c): if c in a: return a[a.fin... |
Jan. 10, 2020, 4:59 p.m. |
+1 |
Experience for voted solution caldeius: 1 on 1-liner: array[bool][bool]-Phil15 |
Jan. 10, 2020, 11:27 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: I mean avoid procrastinating about looking for a job, by having fun coding. :-D |
Jan. 10, 2020, 11:21 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: @oduvan Few things * Great stages, I suppose you valid this Temple idea. :-) * **I think I would pre... |
Jan. 10, 2020, 10:52 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: For readability purpose, it's equivalent to: def between_markers(a, b, c): if c in a: return a[a.fin... |
Jan. 10, 2020, 10:52 a.m. |
+5 |
Experience for appreciated comment oduvan: 1 on Phil15: For readability purpose, it's equivalent to: def between_markers(a, b, c): if c in a: return a[a.fin... |
Jan. 9, 2020, 10:47 p.m. |
+1 |
Experience for voted solution Sarina: 1 on Army with 3 properties : is_alive, warrior, pop-Phil15 |
Jan. 9, 2020, 8:42 p.m. |
+6 |
Experience for voted solution janpaweldrugi: 4 on Eulerian path-Phil15 |
Jan. 9, 2020, 8:17 a.m. |
+1 |
Experience for voted comment oduvan: 1 on Phil15: When I imagine this island, I see a **Mayan pyramid floating in water or space**, humbly named **Tem... |
Jan. 8, 2020, 12:37 p.m. |
+1 |
Experience for voted solution Nerenisa: 1 on 4-lines: ''.join(generator)-Phil15 |
Jan. 8, 2020, 2:04 a.m. |
+5 |
Experience for appreciated comment aya.kanazawa: 1 on Phil15: `roots` could be a list instead of a dict. More importantly, since you only need the last element in... |
Jan. 8, 2020, 2:04 a.m. |
+2 |
Experience for voted comment aya.kanazawa: 1 on Phil15: `roots` could be a list instead of a dict. More importantly, since you only need the last element in... |
Jan. 8, 2020, 1:42 a.m. |
+2 |
Experience for voted solution eugene128736871: 2 on lambda and math upper bound-Phil15 |
Jan. 8, 2020, 1:39 a.m. |
+4 |
Experience for voted solution eugene128736871: 4 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Jan. 7, 2020, 12:44 p.m. |
+1 |
Experience for voted solution maybejadey: 1 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Jan. 7, 2020, 12:01 p.m. |
+7 |
Experience for voted solution Alice_Parker-Louth: 1 on Color Black/White stones graphs to get B/W territories, look B/W borders, sum lengths of B/W eaten territories-Phil15 |
Jan. 7, 2020, 11:47 a.m. |
+1 |
Experience for voted comment veky: 1 on Phil15: I did not really test it before. Now I have: in checkio editor, it passes all tests ; but on my mach... |
Jan. 6, 2020, 5:13 p.m. |
+17 |
Experience for voted solution veky: 3 on [15-lines] Timing a single recursive DFS-Phil15 |
Jan. 6, 2020, 1:55 p.m. |
+3 |
Experience for voted solution vashrepetitor05: 3 on Army with 3 properties : is_alive, warrior, pop-Phil15 |
Jan. 5, 2020, 10:17 p.m. |
+1 |
Experience for voted solution denis.pilyaev: 1 on 1-liner: array[bool][bool]-Phil15 |
Jan. 5, 2020, 10:01 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: Not my favourite puzzle because I do not have much fun solving this manually, too automatic. But sol... |
Jan. 5, 2020, 12:45 p.m. |
+24 |
Experience for voted solution oduvan: 5 on [py3.8+] 50 chars with walrus-Phil15 |
Jan. 5, 2020, 9:39 a.m. |
+2 |
Experience for voted solution maybe: 2 on Lambda function with sum/list comprehension, eval "&", "|" and "^".-Phil15 |
Jan. 4, 2020, 11:11 p.m. |
+15 |
Experience for solved mission Split List |
Jan. 4, 2020, 11:02 p.m. |
+5 |
Experience for solved mission Replace First |
Jan. 4, 2020, 5:30 p.m. |
+8 |
Experience for solved mission Unruly |
Jan. 4, 2020, 5:28 p.m. |
+8 |
Experience for created mission Unruly |
Jan. 2, 2020, 3:32 p.m. |
+1 |
Experience for voted solution wildguyss: 1 on Army with 3 properties : is_alive, warrior, pop-Phil15 |
Jan. 1, 2020, 8:08 p.m. |
-6 |
Experience for voted solution m.kurapov: -1 on All blocks considered at top left, and dictionary of blocks built with rotations of an example of each type.-Phil15 |
Jan. 1, 2020, 2:01 p.m. |
-1 |
Experience for voted comment Bashfulfruit: -1 on Phil15: About "First": It's useful when there is an error, it would say something like "AssertionError: Firs... |
Dec. 30, 2019, 1:55 p.m. |
+11 |
Experience for voted solution tivvit: 4 on Itertools combinations, axis intersection and slope.-Phil15 |
Dec. 30, 2019, 8:53 a.m. |
+5 |
Experience for appreciated comment brispol19: 1 on Phil15: # line 8 type(tree[0]) is str or type(tree[0]) is int # or isinstance(tree[0], (str, int)) # line 19... |
Dec. 30, 2019, 8:53 a.m. |
+2 |
Experience for voted comment brispol19: 1 on Phil15: # line 8 type(tree[0]) is str or type(tree[0]) is int # or isinstance(tree[0], (str, int)) # line 19... |
Dec. 30, 2019, 5:56 a.m. |
+3 |
Experience for voted solution kvalikhanov: 3 on 6-liner relatively clear/creative-Phil15 |
Dec. 29, 2019, 12:39 p.m. |
+5 |
Experience for appreciated comment yoichi: 1 on Phil15: for subtree in tree[1]: if result := find_node(subtree, node): # python 3.8+ return result # No need... |
Dec. 29, 2019, 12:39 p.m. |
+2 |
Experience for voted comment yoichi: 1 on Phil15: for subtree in tree[1]: if result := find_node(subtree, node): # python 3.8+ return result # No need... |
Dec. 29, 2019, 8:54 a.m. |
+30 |
Experience for solved mission River Crossing |
Dec. 28, 2019, 4:27 p.m. |
+5 |
Experience for appreciated comment derrickding95: 1 on Phil15: > By the way, your gaming strategy problems are time-consuming but exciting! Yeah no doubt, there ar... |
Dec. 28, 2019, 4:27 p.m. |
+1 |
Experience for voted comment derrickding95: 1 on Phil15: > By the way, your gaming strategy problems are time-consuming but exciting! Yeah no doubt, there ar... |
Dec. 28, 2019, 3:28 p.m. |
+1 |
Experience for voted comment HeNeArKr: 1 on Phil15: First, `isisnstance(other, Army)` is nearly the same as `type(other) == Army`. It is for allowing a ... |
Dec. 27, 2019, 4:38 p.m. |
+2 |
Experience for voted solution LucioPg: 2 on decorated for doc-Phil15 |
Dec. 27, 2019, 4:03 p.m. |
+3 |
Experience for voted solution derrickding95: 3 on 9-liner: BFS-Phil15 |
Dec. 27, 2019, 12:22 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: **_In rare cases, a lancer can kill the second unit before the first._** And tests are not necessari... |
Dec. 26, 2019, 9 p.m. |
+2 |
Experience for voted solution crash1germun: 1 on [4th version] fast (and limited memory)-Phil15 |
Dec. 24, 2019, 10:28 p.m. |
+3 |
Experience for voted solution maxnrg: 1 on 7-liner without modules-Phil15 |
Dec. 23, 2019, 7:17 p.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: I like the river crossing picture with the color gradients. 😄 |
Dec. 23, 2019, 7:17 p.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: I like the river crossing picture with the color gradients. 😄 |
Dec. 23, 2019, 9:26 a.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: I liked the Idea of giving the user a Counter object. Is it keyword arguments? assert river_crossing... |
Dec. 23, 2019, 9:26 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: I liked the Idea of giving the user a Counter object. Is it keyword arguments? assert river_crossing... |
Dec. 23, 2019, 6:38 a.m. |
+3 |
Experience for voted solution s10018: 1 on try iterate from it except TypeError-Phil15 |
Dec. 23, 2019, 1:18 a.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: @kurosawa4434 To complete what @veky told you, in `referee.py` # To give the user a counter cover = ... |
Dec. 23, 2019, 1:18 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: @kurosawa4434 To complete what @veky told you, in `referee.py` # To give the user a counter cover = ... |
Dec. 21, 2019, 6:39 p.m. |
+21 |
Experience for voted solution tivvit: 4 on My playfair cipher-Phil15 |
Dec. 21, 2019, 9:38 a.m. |
+4 |
Experience for voted solution Univorsus: 1 on [py3.8+] 1-liner: 115 chars-Phil15 |
Dec. 20, 2019, 6:21 p.m. |
+1 |
Experience for voted solution andriy.anatolich: 1 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Dec. 18, 2019, 4:38 p.m. |
+5 |
Experience for solved mission Univocalic davasaan |
Dec. 18, 2019, 4:36 p.m. |
+5 |
Experience for created mission Univocalic davasaan |
Dec. 18, 2019, 1:46 p.m. |
+1 |
Experience for voted solution murtagy: 1 on 4-lines: ''.join(generator)-Phil15 |
Dec. 17, 2019, 4:39 p.m. |
-1 |
Experience for voted comment hwdyhewhdh: -1 on Phil15: `lru_cache` needs to be called! `lru_cache` also needs all arguments to be hashable, so no lists in ... |
Dec. 17, 2019, 5:52 a.m. |
+2 |
Experience for voted solution oerba: 1 on re.findall-Phil15 |
Dec. 17, 2019, 12:02 a.m. |
+4 |
Experience for voted solution nmay: 1 on [py3.8+] 1-liner: 117 chars-Phil15 |
Dec. 16, 2019, 9:23 p.m. |
+7 |
Experience for voted solution Sioul: 1 on Obvious 1-liner-Phil15 |
Dec. 16, 2019, 4:48 p.m. |
+1 |
Experience for voted comment hwdyhewhdh: 1 on Phil15: @kurosawa4434 And avoid infinite loops is also great. :-) |
Dec. 16, 2019, 4:48 p.m. |
+5 |
Experience for appreciated comment hwdyhewhdh: 1 on Phil15: @kurosawa4434 And avoid infinite loops is also great. :-) |
Dec. 16, 2019, 10:04 a.m. |
+1 |
Experience for voted comment hwdyhewhdh: 1 on Phil15: You are stuck in `while nf > 0:` loop in findpath function. It seems `nf == 3` for eternity. Then, `... |
Dec. 16, 2019, 10:04 a.m. |
+5 |
Experience for appreciated comment hwdyhewhdh: 1 on Phil15: You are stuck in `while nf > 0:` loop in findpath function. It seems `nf == 3` for eternity. Then, `... |
Dec. 15, 2019, 6:50 p.m. |
+1 |
Experience for voted comment HeNeArKr: 1 on Phil15: Check part have three more tests: assert climbing_route([ '000002000000', '000001000000', '000000000... |
Dec. 15, 2019, 9:35 a.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: You are stuck in `while nf > 0:` loop in findpath function. It seems `nf == 3` for eternity. Then, `... |
Dec. 15, 2019, 9:35 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: You are stuck in `while nf > 0:` loop in findpath function. It seems `nf == 3` for eternity. Then, `... |
Dec. 15, 2019, 9:35 a.m. |
+1 |
Experience for voted comment kurosawa4434: 1 on Phil15: @kurosawa4434 And avoid infinite loops is also great. :-) |
Dec. 15, 2019, 9:35 a.m. |
+5 |
Experience for appreciated comment kurosawa4434: 1 on Phil15: @kurosawa4434 And avoid infinite loops is also great. :-) |
Dec. 14, 2019, 3:01 p.m. |
+1 |
Experience for voted solution dev0611: 1 on v2 (from flpo veky and myself): Party(Named, set), Friends(str) with lambda show_invite-Phil15 |
Dec. 14, 2019, 11:04 a.m. |
+17 |
Experience for voted solution colinmcnicholl: 3 on [8lines+old code] Rectangles based on edges from convex hull, change complex coordinates to have bounding boxes-Phil15 |
Dec. 13, 2019, 10 a.m. |
+5 |
Experience for appreciated comment colinmcnicholl: 1 on Phil15: Great job with numpy! Even if I prefer my way with complex numbers. `cmath` module could do a part o... |
Dec. 13, 2019, 10 a.m. |
+1 |
Experience for voted comment colinmcnicholl: 1 on Phil15: Great job with numpy! Even if I prefer my way with complex numbers. `cmath` module could do a part o... |
Dec. 12, 2019, 2:01 p.m. |
+4 |
Experience for voted solution mazzi: 4 on decorated for doc-Phil15 |
Dec. 12, 2019, 10:58 a.m. |
+1 |
Experience for voted comment colinmcnicholl: 1 on Phil15: I don't see the vote +3. :-D > I like how your convex hull() function works from far left over high ... |
Dec. 12, 2019, 9:32 a.m. |
+2 |
Experience for voted solution brispol19: 2 on [v3] 1-liner: count odd divisors (the naive way)-Phil15 |
Dec. 12, 2019, 8:42 a.m. |
+1 |
Experience for voted comment brispol19: 1 on Phil15: Well, we use both sides of the list here. One side to add new units, the other to fight and die. And... |
Dec. 11, 2019, 7:43 p.m. |
+1 |
Experience for voted comment bildja: 1 on Phil15: No forum post to tell us there is a great mission to solve? Solved it efficiently anyway! :-D |
Dec. 11, 2019, 8:10 a.m. |
+2 |
Experience for voted solution pseidel: 2 on My "long repeat inside" program-Phil15 |
Dec. 10, 2019, 2:12 p.m. |
+1 |
Experience for voted solution huynhphillip57: 1 on [v2] enumerate, try line.index, max(..., key=len)-Phil15 |
Dec. 8, 2019, 6:18 p.m. |
+15 |
Experience for solved mission On the same path |
Dec. 8, 2019, 6:12 p.m. |
+15 |
Experience for created mission On the same path |
Dec. 4, 2019, 6:49 p.m. |
+1 |
Experience for voted comment Sim0000: 1 on Phil15: Two other points: 3. `ch.isupper()` is the same as `ch.isupper() == True`, the method returning True... |
Dec. 4, 2019, 2:51 p.m. |
+1 |
Experience for voted comment Vegardes: 1 on Phil15: [4,6,2,2,2,6,4,4,4] 4 is here 4 times 6 is here 2 times 2 is here 3 times 4>3>2 so 4s then 2s then 6... |
Dec. 3, 2019, 7:03 p.m. |
+1 |
Experience for voted comment HeNeArKr: 1 on Phil15: **Great community indeed.** _Small enough_ to hope to be the "leader of the month". _Big enough_ to ... |
Dec. 3, 2019, 1:38 p.m. |
+8 |
Experience for solved mission Four To The Floor |