18
Last seen 9 months ago
Member for 9 years, 6 months, 20 days
Difficulty Normal
Aug. 2, 2018, 6:50 a.m. | + 3 | for First-CosimoOne |
Aug. 1, 2018, 8:23 p.m. | + 1 | for First-sculylr |
Aug. 1, 2018, 8:13 p.m. | + 2 | for First-crazyc |
Aug. 1, 2018, 8:07 p.m. | + 2 | for First-hisatatu |
July 31, 2018, 10:07 p.m. | + 1 | for Like counting sheep-HeNeArKr |
July 31, 2018, 10:06 p.m. | + 3 | for First-mozurin |
July 31, 2018, 10:06 p.m. | + 2 | for init dict and split by word.-yanhua.dev |
July 31, 2018, 10:05 p.m. | + 1 | for Is it better to compute everything in one single line or to write many short and clear lines?-Repetitor_Batajsk |
July 31, 2018, 8:50 p.m. | + 1 | for Simple and One loop-belary |
July 31, 2018, 2:21 p.m. | + 1 | for First-ttfkoga |
July 31, 2018, 2:16 p.m. | + 1 | for First-soloshowing |
Jan. 31, 2018, 2:01 p.m. | + 4 | for Second-CyrylWilczek |
May 10, 2017, 1:55 a.m. | + 3 | for First-Leonid_Tarasov_PL_Mmf |
Nov. 27, 2016, 5:25 p.m. | + 4 | for First-coells |
Sept. 10, 2016, 9:09 a.m. | + 4 | for A derelict battery-veky |
Dec. 27, 2015, 1:56 p.m. | + 4 | for 60-DiZ |
Aug. 8, 2015, 12:51 p.m. | + 1 | for Comment siebenschlaefer: If you want to keep it as short as possible you could write ``sum(a)`` instead of ``a[0]+a[1]``. |
July 22, 2015, 2:14 p.m. | + 3 | for First-bukebuer |
July 22, 2015, 2:13 p.m. | + 2 | for reduce-Sim0000 |
July 18, 2015, 9 p.m. | + 1 | for Comment tartavull: beautiful |
June 26, 2015, 8:32 a.m. | + 3 | for First-panaro32 |
June 25, 2015, 3:02 p.m. | + 3 | for First-takapt0226 |
June 24, 2015, 8:58 a.m. | + 3 | for First-Amachua |
June 15, 2015, 7:56 a.m. | + 1 | for First-ewlooney |
June 15, 2015, 7:56 a.m. | + 1 | for Comment ewlooney: Nice and clean. Might be slightly better if you used "item" or "number" instead of "i" - since i is ... |
June 10, 2015, 10:20 a.m. | + 2 | for First-gyahun_dash |
June 4, 2015, 8:58 a.m. | + 1 | for List comprehension-stclair.daniel_f70a54fff4764c4 |
May 29, 2015, 10:29 a.m. | + 2 | for First-light2happy.718 |
May 29, 2015, 10:28 a.m. | + 2 | for First-aureooms |
May 29, 2015, 10:28 a.m. | + 1 | for Bottom-up-abe.dillon |
May 28, 2015, 8:46 p.m. | + 3 | for one-liner-svfat |
May 28, 2015, 9:37 a.m. | + 2 | for First-Amachua |
May 26, 2015, 10:48 a.m. | + 2 | for First-Sim0000 |
May 18, 2015, 6:55 a.m. | + 1 | for Comment JayLee: my updated code: def checkio(data): list = [x for x in data if data.count(x) > 1] return list |
May 18, 2015, 6:53 a.m. | + 1 | for Comment JayLee: oh actually I had updated my solution with list comp, but didn't publish as second lol. but yeah you... |
May 17, 2015, 7:28 p.m. | + 1 | for First-JayLee |
April 4, 2015, 5:17 p.m. | + 1 | for Bitmask & Shift-arma |
March 31, 2015, 2:15 p.m. | + 2 | for First-ciel |
March 31, 2015, 2:14 p.m. | + 1 | for Comment bryukh: Yep - 12. But **"Your result: 18"** |
March 31, 2015, 7:28 a.m. | + 2 | for First-tamacjp |
March 20, 2015, 11 a.m. | + 2 | for Double ended-veky |
March 16, 2015, 10:25 a.m. | + 1 | for First-DanielHunnicutt |
Feb. 20, 2015, 2:04 p.m. | + 1 | for "Elementary" One-liners Overview |
Feb. 9, 2015, 1:04 p.m. | + 1 | for Comment suic: Hi, I have two comments: 1. Look at _math.degrees_. 2. On lines 5-7 you have three times the same pa... |
Feb. 9, 2015, 1:04 p.m. | + 1 | for Comment suic: One edit: # This would be even better: return len(data) >= 10 and re.search(...) # :) |
Feb. 9, 2015, 7:52 a.m. | + 2 | for First-fess |
Feb. 9, 2015, 7:52 a.m. | + 1 | for First-paul.michalski.94 |
Feb. 9, 2015, 7:51 a.m. | + 2 | for First-hydeparkk |
Feb. 9, 2015, 7:50 a.m. | + 1 | for First-gautamas |
Feb. 9, 2015, 7:49 a.m. | + 1 | for Non-unique Elements (fixed documentation)-MadCow234 |
Feb. 9, 2015, 7:47 a.m. | + 2 | for One-liner-suic |
Feb. 6, 2015, 2:23 p.m. | + 3 | for First-JulianNicholls |
Feb. 2, 2015, 10:43 a.m. | + 3 | for First-digitalraven |
Feb. 2, 2015, 10:26 a.m. | + 1 | for First-viprip |
Jan. 31, 2015, 2:33 p.m. | + 1 | for Comment suic: Hi, you missed a bit the concept of list comprehension: You could write: new = [i for i in data if d... |
Jan. 26, 2015, 12:41 p.m. | + 2 | for Stack-veky |
Jan. 21, 2015, 2:44 p.m. | + 2 | for First-7nat7 |
Jan. 21, 2015, 2:43 p.m. | + 3 | for oneLiner-donBit |
Jan. 21, 2015, 10:21 a.m. | + 1 | for Task Feed Pigeons |
Jan. 20, 2015, 7:35 p.m. | + 1 | for Comment erik.white.2014: if language == "українська": return "Я люблю Python!" |
Jan. 20, 2015, 7:34 p.m. | + 1 | for First-Amachua |
Jan. 17, 2015, 1:12 p.m. | + 2 | for First-Sim0000 |
Jan. 17, 2015, 8:57 a.m. | + 1 | for Comment DavidJones: This is good, I like the indexing, but you should also check out the hint for use of the ord() and c... |
Jan. 9, 2015, 12:02 p.m. | + 2 | for Hinted-veky |
Jan. 9, 2015, 12:02 p.m. | + 3 | for The Key-bryukh |
Jan. 9, 2015, 11:14 a.m. | + 1 | for Comment cle99y: thanks for the feedback. This was one of my first attempts at Python. Often when I check other solut... |
Jan. 9, 2015, 11:13 a.m. | + 1 | for Comment cle99y: the argument passed to the function is a tuple :) |
Jan. 9, 2015, 10:19 a.m. | + 1 | for First-cle99y |
Jan. 6, 2015, 1:59 p.m. | + 1 | for Intersection-bryukh |
Jan. 5, 2015, 12:19 p.m. | + 3 | for Hinted-veky |
Jan. 5, 2015, 10:48 a.m. | + 1 | for Hinted-veky |
Dec. 29, 2014, 8:17 a.m. | + 2 | for First-bukebuer |
Dec. 26, 2014, 10:59 a.m. | + 1 | for Double loop-bryukh |
Nov. 21, 2014, 2:31 p.m. | + 1 | for First-mr.floppy |
Nov. 21, 2014, 1:41 p.m. | + 2 | for dimpleqonx-veky |
Nov. 21, 2014, 9:44 a.m. | + 2 | for First-madmanbob |
Nov. 14, 2014, 1:38 p.m. | + 2 | for First-gcampfield |
Nov. 14, 2014, 1:38 p.m. | + 2 | for First-Tubis |
Nov. 14, 2014, 1:37 p.m. | + 2 | for for else-veky |
Nov. 6, 2014, 7:47 p.m. | + 2 | for First-Sim0000 |
Nov. 6, 2014, 2:11 p.m. | + 2 | for o, safe pawns...-veky |
Nov. 6, 2014, 2:11 p.m. | + 2 | for First-Kerulen |
Nov. 6, 2014, 12:48 p.m. | + 1 | for Task Index Power |
Nov. 6, 2014, 12:48 p.m. | + 1 | for Task Fizz Buzz |
Nov. 6, 2014, 12:47 p.m. | + 1 | for Task I Love Python! |
Nov. 6, 2014, 12:47 p.m. | + 1 | for Task Speech Module |
Nov. 6, 2014, 12:47 p.m. | + 1 | for Task Xs and Os Referee |
Nov. 6, 2014, 12:47 p.m. | + 1 | for Task The Most Wanted Letter |
Nov. 6, 2014, 12:47 p.m. | + 1 | for Task Moore Neighbourhood |
Nov. 6, 2014, 12:47 p.m. | + 1 | for Task House Password |
Nov. 6, 2014, 12:46 p.m. | + 1 | for Task Median |
Nov. 6, 2014, 12:46 p.m. | + 1 | for Task Non-unique Elements |
Nov. 6, 2014, 9:17 a.m. | + 1 | for Comment oduvan: In python you can simply say: if v=={}: Does that help? |
Nov. 6, 2014, 9:17 a.m. | + 1 | for Comment brlm.franke: for k, v in current.items(): if v == {}: result["/".join((path + (k,)))] = "" elif isinstance(v, dic... |
Nov. 5, 2014, 3:36 p.m. | + 2 | for First-gyahun_dash |
Nov. 5, 2014, 3:22 p.m. | + 2 | for First-Hanna_Hofman |
Nov. 5, 2014, 3:01 p.m. | + 2 | for First-makoto_yamagata |
Nov. 5, 2014, 9:56 a.m. | + 2 | for Second-gyahun_dash |
Nov. 4, 2014, 8:05 p.m. | + 1 | for max-count-bryukh |
Nov. 4, 2014, 6:08 p.m. | + 1 | for Comment bunnychai: loop through the possible (dx, dy) around (row, col), then check whether (row+dx, col+dy) is within ... |