Nov. 23, 2017, 1:43 p.m. |
+ 1 |
for Comment
nickie: This is a great solution because the story says: "alloy names are presented as strings, which are co...
|
Nov. 23, 2017, 1:43 p.m. |
+ 1 |
for Comment
nickie: Nice. However, you're making no effort to find the solution with a small number of guesses; in fact ...
|
Nov. 23, 2017, 1:41 p.m. |
+ 1 |
for Comment
BpLife: assert checkio("10:37:49") == ".- .... : .-- .--- : -.. -..-", "First Test" Perfect
|
Nov. 23, 2017, 1:40 p.m. |
+ 1 |
for Comment
veky: Bravo, bravo, bravo! Again, tests don't test, and bunny scores! :-D
|
Nov. 23, 2017, 1:40 p.m. |
+ 1 |
for Comment
shantanoo: if __name__ == '__main__': Invalid time also works. e.g. assert checkio("30:37:49") == "-- .... : .-...
|
Nov. 23, 2017, 1:37 p.m. |
+ 1 |
for Comment
nickie: An explanation of this solution is in the attached PDF file. The motivation for writing this came wh...
|
Nov. 23, 2017, 1:37 p.m. |
+ 1 |
for Comment
nickie: Once more, well done! It was obvious that an O(N) dynamic programming solution was possible, but it ...
|
Nov. 23, 2017, 1:33 p.m. |
+ 1 |
for Comment
DiEvAl_0d0e0434e59e45f68684d0e: k = int((6 * number) ** (1.0 / 3)) if k * (k + 1) * (k + 2) > 6 * number: k -= 1 This was pretty sma...
|
Dec. 23, 2014, 9:47 a.m. |
+ 1 |
for Comment
ignalion: It's nice but there's a bit overhead for me.
|
Dec. 11, 2014, 2:39 p.m. |
+ 1 |
for Comment
pohmelie: Heh, my solution have same idea, but with some extra additions: * When you write "a in self.connecti...
|
Nov. 23, 2014, 3:51 a.m. |
+ 1 |
for Comment
SleepyHarry: There's a slight bug with this I believe, which occurs when the point we're testing is outside the p...
|
Nov. 6, 2014, 4:26 p.m. |
+ 1 |
for Comment
DiZ: Very stable solution, although your approach is a bit complicated ;-)
|
Oct. 29, 2014, 1:59 p.m. |
+ 1 |
for Comment
veky: Line 2: you can use map. Line 3: you don't need () around h % 12.
|
Oct. 23, 2014, 8:14 a.m. |
+ 1 |
for Comment
vinc: Congratulations! Good job. I should explore this at leisure;)
|
Oct. 16, 2014, 9:04 a.m. |
+ 1 |
for Comment
veky: Very mathematical solution. :-D
|
Oct. 16, 2014, 9:04 a.m. |
+ 1 |
for Comment
veky: Lines 22~31 are a crime against humanity. Or at least they should be. ;-P size = sum(1 + c.isupper()...
|
Oct. 13, 2014, 4:47 a.m. |
+ 1 |
for Comment
blabaster: To chase the reflection - perfect. Final checks sometimes fails: while True: assert checker(hunt, ('...
|
Oct. 2, 2014, 3:46 a.m. |
+ 1 |
for Comment
veky: You don't need those \\ continuations (you're inside parentheses). Also, line 10 is just "if r > res...
|
Sept. 27, 2014, 5:43 a.m. |
+ 1 |
for Comment
reviewboy: Similar to what I did, so I'm biased. Thumbs up. :)
|
Sept. 18, 2014, 12:20 p.m. |
+ 1 |
for Comment
veky: Line 2: divmod(i, 4). Line 6: drop the []. sorted((j, 3-i) for ...) "conv" is not really a very desc...
|
Sept. 9, 2014, 3:22 a.m. |
+ 1 |
for Comment
mr.floppy: What i wanted my solution to look like! I'll have to look into Counter()
|
Aug. 29, 2014, 6:13 p.m. |
+ 1 |
for Comment
vinc: Too many nested loops. Poor reading. Lines 32-33: for dx, dy in ((0, -1), (0, 1), (-1, 0), (1, 0)): ...
|
Aug. 14, 2014, 1:37 p.m. |
+ 1 |
for Comment
vinc: def minimum(data): ms = list(set([x[0] for x in data])) check = [] for m in ms: if all(d.find(m) <= ...
|
July 23, 2014, 10:12 a.m. |
+ 1 |
for Comment
bryukh: My first thought was - "Hm, it's my solution. Maybe I clicked a wrong link." :)
|
June 9, 2014, 11:18 a.m. |
+ 1 |
for Comment
pcresolver: I can't believe how short this is. Didn't know about split() or ceil(). Thanks very much,
|
March 12, 2014, 7:06 p.m. |
+ 1 |
for Comment
veky: re is obviously an overkill here. With the necessary escaping it is even longer than ordinary index ...
|
March 3, 2014, 3:39 a.m. |
+ 1 |
for Comment
guido: I love that you're defining a class here that can be reused for other similar problems. Why the rena...
|
March 3, 2014, 3:32 a.m. |
+ 1 |
for Comment
guido: I don't think this solution is particularly clear -- I like your projective math version better, and...
|
March 2, 2014, 4:40 a.m. |
+ 1 |
for Comment
endomorphism1: trans function is just impressive!
|
Feb. 26, 2014, 8:47 a.m. |
+ 1 |
for Comment
veky: Nice and transparent, if a bit boring, especially those at the beginning. A few details: * if z in S...
|
Feb. 21, 2014, 3:50 a.m. |
+ 1 |
for Comment
veky: It's really fascinating to learn that not even you: * use map in line 5: width = max(map(len, lines)...
|
Feb. 17, 2014, 7:15 a.m. |
+ 1 |
for Comment
nickie: This problem is much harder than it first looks. Not because it's hard to find a winning strategy fo...
|
Feb. 12, 2014, 3:45 a.m. |
+ 1 |
for Comment
veky: LOL about that "-1" in line 8... isn't it more clear to use slicing? f0, f1 = map(bin(first)[2:].cou...
|
Feb. 8, 2014, 3:15 p.m. |
+ 1 |
for Comment
nickie: I think this solution could pass as "clear". The loop in line 38 counts each row that it finds and a...
|
Feb. 7, 2014, 4:44 a.m. |
+ 1 |
for Comment
nickie: Very well done! I'm giving an explanation for this formula in [Veky's solution](http://www.checkio.o...
|
Feb. 6, 2014, 3:19 a.m. |
+ 1 |
for Comment
veky: Argh, float("%.2f" % x)... you really should use the function "round". ;-)
|
Jan. 31, 2014, 5:41 a.m. |
+ 1 |
for Comment
UndeadMonkey: Not very readable, but looks succinct. Perhaps better naming of the variables would have helped.
|
Jan. 25, 2014, 2:48 p.m. |
+ 1 |
for Comment
grutte_pier: I don't agree at all with people saying the solution is not 'readable': learn your maths!
|
Jan. 24, 2014, 7:02 a.m. |
+ 1 |
for Comment
datruth29: This is cool, didn't think about using recursion!
|
Jan. 23, 2014, 5:27 a.m. |
+ 1 |
for Comment
MasterSergius: Fast solution, but it is opposite to Zen of Python. You have to comment at least, explain method and...
|
Jan. 20, 2014, 4:10 a.m. |
+ 1 |
for Comment
Uladzimir: From one side it's cool, because your algorithm is O(1), but it's completely unreadable, so such sol...
|
Jan. 17, 2014, 3:34 a.m. |
+ 1 |
for Comment
HighOrbit: This is impressive. I can't read it at all though... Time to go learn me some maths...
|
Jan. 10, 2014, 5:02 p.m. |
+ 1 |
for Comment
RyanDagg: Love the trans function. Well done.
|
Jan. 10, 2014, 3:02 p.m. |
+ 1 |
for Comment
Dragonfly555: Didn't like the use of letters as variables. it's unreadable. a plus for you is that you didn't use ...
|
Jan. 9, 2014, 7:16 a.m. |
+ 1 |
for Comment
pkstarstorm05: I right with you atrioom. I would have never come to this solution. I'm not a mathematician by train...
|
Jan. 8, 2014, 7:02 a.m. |
+ 1 |
for Comment
DiZ: Simple approach (not as ugly as you said!) Just to give you a more pythonic implementation: def chec...
|
Jan. 8, 2014, 7 a.m. |
+ 1 |
for Comment
atrioom: I'd never have come to this. Partly because I didn't know **, but mostly because it is beyond my int...
|
Jan. 7, 2014, 4:21 a.m. |
+ 1 |
for Comment
DiZ: Nice solution (quite the same on my own, except I reasoned on k-1). Just a bit surprised by last lin...
|
Jan. 3, 2014, 1:40 p.m. |
+ 1 |
for Comment
veky: Great! BTW you don't need [] in argument for join.
|
Jan. 3, 2014, 8 a.m. |
+ 1 |
for Comment
shreekar: Liked the way you normalized the percent-octets. Cool...
|
Dec. 31, 2013, 2:11 p.m. |
+ 1 |
for Comment
nickie: It seems that you had a clearer mind than me for simplifications... :-) Good job.
|
Dec. 31, 2013, 4:42 a.m. |
+ 1 |
for Comment
bryukh: Ok. I forgot about __builtins__ :) Thanks.
|
Dec. 31, 2013, 4:42 a.m. |
+ 1 |
for Comment
veky: Many other cheats are possible. See my solution for possibilities. :-)
|
Dec. 29, 2013, 3:32 p.m. |
+ 1 |
for Comment
Lingson: Even though the solution doesnt meet the purpose of the mission, but still 1 Like for the cool cheat...
|
Dec. 27, 2013, 10:41 a.m. |
+ 1 |
for Comment
bryukh: o + o Looks like smile :)
|
Dec. 26, 2013, 11:46 a.m. |
+ 1 |
for Comment
shreekar: I got the main logic right, but your final solution is much simpler and easier than mine.
|
Dec. 26, 2013, 4:54 a.m. |
+ 1 |
for Comment
marshall.zheng: it looks awesome but can you elaborate this solution?
|
Dec. 25, 2013, 11:16 a.m. |
+ 1 |
for Comment
Amachua: Happy to see that a O(1) solution exists! :)
|
Dec. 23, 2013, 6:52 a.m. |
+ 1 |
for Comment
qbi: f, s = d / 10, d % 10 Seems like a perfect case for *divmod()*.
|
Dec. 20, 2013, 11:11 a.m. |
+ 1 |
for Comment
shreekar: Did almost the same way, but using functions.
|
Dec. 17, 2013, 2:37 p.m. |
+ 1 |
for Comment
sapamja: Damn this is awesome, never thought i can solve this way :) but I learnt.
|
Dec. 16, 2013, 4:24 a.m. |
+ 1 |
for Comment
datruth29: Sexy. I was thinking of something along the lines with using format to display the binary digits tha...
|
Dec. 11, 2013, 11:48 a.m. |
+ 1 |
for Comment
forrest1988: r += '{0:03b} '.format(f) wow, I didn't know that it can be so simple.
|
Dec. 6, 2013, 4:43 a.m. |
+ 1 |
for Comment
rupadhya: Like your solution. r, d = '', int(d) is new to me .
|
Nov. 20, 2013, 5:35 p.m. |
+ 1 |
for Comment
rmidyanyy: Honestly? I consider this solution correct, but a bit ugly :) But still algo is probably the same in...
|
Nov. 17, 2013, 2:59 p.m. |
+ 1 |
for Comment
nickie: Factorization is not the way to approach this: >>> checkio(2**127) 288888888888888888888888888888888...
|
Oct. 23, 2013, 11:59 a.m. |
+ 1 |
for Comment
alexche_8: Hey, looks good! I have solution like your again :) But it without try/except block http://www.check...
|
Oct. 2, 2013, 7:26 a.m. |
+ 1 |
for Comment
Kush82: Very smart solution! But it works only if all alloys of two components. However in task: > composed ...
|
Nov. 19, 2012, 11:24 p.m. |
+ 1 |
for Comment
Timmy72: It's lucky, but it's false ! You don't include multiple space in ends of lines when the next word is...
|
Nov. 12, 2012, 10:47 p.m. |
+ 1 |
for Comment
YannickCopin: The management of spaces is tedious. You could gather all token strings in a list, and return ' '.jo...
|