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. 17, 2014, 7:14 a.m. |
+ 2 |
for
7 or fewer-nickie
|
Feb. 15, 2014, 4:36 p.m. |
+ 1 |
for Comment
Sai_Amano: Great!
|
Feb. 12, 2014, 10:29 a.m. |
+ 1 |
for Comment
veky: because result of bin starts with "0" that has nothing to do with zero bit. (I know _you_ know, but ...
|
Feb. 12, 2014, 3:47 a.m. |
+ 2 |
for
Other bit operators-veky
|
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. 11, 2014, 11:15 a.m. |
+ 1 |
for Comment
bryukh: ok. I will add the new test for it and will kill your solution!!! ha ha HA HA HA... Sorry, i wanted ...
|
Feb. 8, 2014, 3:22 p.m. |
+ 3 |
for
Bunny's simplified-nickie
|
Feb. 8, 2014, 3:15 p.m. |
+ 1 |
for Comment
nickie: The simplified version is [here](http://www.checkio.org/mission/cakes-rows/publications/nickie/pytho...
|
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. 8, 2014, 6:56 a.m. |
+ 2 |
for
First-htamas
|
Feb. 7, 2014, 4:50 a.m. |
+ 3 |
for
Do the math-nickie
|
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:20 a.m. |
+ 3 |
for
Complement-veky
|
Feb. 6, 2014, 3:19 a.m. |
+ 1 |
for Comment
veky: Argh, float("%.2f" % x)... you really should use the function "round". ;-)
|
Feb. 6, 2014, 3:19 a.m. |
+ 1 |
for Comment
veky: Me too. In fact I saw in solutions list the title of Juge_Ti's solution, so I knew he had a proof. :...
|
Feb. 1, 2014, 5:24 a.m. |
+ 1 |
for Comment
Alf_: Ok
|
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. 21, 2014, 3:48 p.m. |
+ 1 |
for
code<FONT-veky
|
Jan. 20, 2014, 9:21 a.m. |
+ 1 |
for Comment
bryukh: Thanks. You are right. Fixed.
|
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. 18, 2014, 3:42 a.m. |
+ 1 |
for Comment
seandor: It seems very great:D
|
Jan. 17, 2014, 5 p.m. |
+ 1 |
for
First-AlexeyIvchenko
|
Jan. 17, 2014, 4:56 p.m. |
+ 1 |
for
First-AlexeyIvchenko
|
Jan. 17, 2014, 4:33 p.m. |
+ 1 |
for
First-Amachua
|
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. 16, 2014, 10:15 a.m. |
+ 1 |
for
BFS-htamas
|
Jan. 16, 2014, 10:15 a.m. |
+ 1 |
for
ACO-Zanzacar
|
Jan. 16, 2014, 5:11 a.m. |
+ 2 |
for
Gauss & mod-nickie
|
Jan. 15, 2014, 10:06 a.m. |
+ 1 |
for
Maths - with proof-Juge_Ti
|
Jan. 15, 2014, 9:52 a.m. |
+ 1 |
for
First-madmanbob
|
Jan. 11, 2014, 11:54 a.m. |
+ 1 |
for Post
Suggestion: Scoring across multiple criteria
|
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:31 a.m. |
+ 5 |
for
First-DiZ
|
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:42 p.m. |
+ 5 |
for
Monster-veky
|
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...
|
Jan. 2, 2014, 2:39 a.m. |
+ 1 |
for Post
Greeting
|
Dec. 31, 2013, 2:20 p.m. |
+ 3 |
for
First-DiEvAl_0d0e0434e59e45f68684d0e
|
Dec. 31, 2013, 2:15 p.m. |
+ 3 |
for
Do the math, O(1)-nickie
|
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:44 a.m. |
+ 2 |
for
Pandemonium-veky
|
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. 30, 2013, 2:24 a.m. |
+ 1 |
for Comment
RyanDagg: Yay math.
|
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, 11:31 a.m. |
+ 1 |
for
Meet our autumn top player!
|
Dec. 27, 2013, 10:41 a.m. |
+ 1 |
for Comment
bryukh: o + o Looks like smile :)
|
Dec. 26, 2013, 11:47 a.m. |
+ 1 |
for
Gold Fraction-shreekar
|
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. 26, 2013, 4:54 a.m. |
+ 1 |
for Comment
bryukh: Mmm, the pure math. Super!
|
Dec. 25, 2013, 2:48 p.m. |
+ 1 |
for Post
The new WeirdTask "Restricted Prime"
|
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:13 a.m. |
+ 1 |
for
Lights-shreekar
|
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. 16, 2013, 2:57 a.m. |
+ 1 |
for
Bunny fixed-nickie
|
Dec. 16, 2013, 2:48 a.m. |
+ 1 |
for Comment
nickie: On the other hand, how about this? assert checkio({ 'gold-tin': Fraction(1, 2), 'gold-iron': Fractio...
|
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. 10, 2013, 2:18 p.m. |
+ 1 |
for Comment
marshall.zheng: Nice work!
|
Dec. 10, 2013, 2:18 p.m. |
+ 1 |
for Comment
romalops: My god ! Nice work !
|
Dec. 8, 2013, 5:29 p.m. |
+ 1 |
for Comment
berserk9779: Nice
|
Dec. 6, 2013, 4:43 a.m. |
+ 1 |
for Comment
rupadhya: Like your solution. r, d = '', int(d) is new to me .
|
Dec. 4, 2013, 6:46 a.m. |
+ 2 |
for
Unary-veky
|
Nov. 27, 2013, 12:27 p.m. |
+ 1 |
for Comment
hobgoblin: nice
|
Nov. 27, 2013, 12:27 p.m. |
+ 1 |
for Comment
hobgoblin: nice
|
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...
|
Nov. 17, 2013, 2:53 p.m. |
+ 1 |
for
First-nickie
|
Nov. 13, 2013, 2:45 p.m. |
+ 1 |
for
Ghost Age & Bats Bunker - the winners
|
Nov. 13, 2013, 2:31 a.m. |
+ 2 |
for
First-kvas
|
Nov. 12, 2013, 3:47 a.m. |
+ 1 |
for Comment
bryukh: I have published it in "Incernator" section. Now you can share the task link with you friend. For ea...
|
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. 23, 2013, 11:59 a.m. |
+ 1 |
for
First-alexche_8
|
Oct. 10, 2013, 3:18 p.m. |
+ 2 |
for
First-alexche_8
|
Oct. 2, 2013, 11:23 a.m. |
+ 1 |
for Comment
bryukh: Nice
|
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 ...
|
Oct. 1, 2013, 5:25 a.m. |
+ 1 |
for Post
fast switch task discussion -> task
|
Sept. 30, 2013, 7:58 a.m. |
+ 1 |
for Comment
Amachua: Haha... So I didn't have to compute the inverse matrix... Nice solution :)
|
Sept. 29, 2013, 2:08 p.m. |
+ 1 |
for Comment
scturtle: Aha!
|
Sept. 25, 2013, 5:26 p.m. |
+ 1 |
for Comment
veky: You mean, considering I wrote it? :-)
|
Sept. 25, 2013, 3:08 p.m. |
+ 1 |
for Comment
veky: Slooow. :-P :-)
|
Sept. 25, 2013, 3:02 p.m. |
+ 2 |
for
Adjustment-veky
|
Sept. 12, 2013, 6:31 a.m. |
+ 2 |
for
DOX and XOX-veky
|
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...
|