Nov. 23, 2017, 1:45 p.m. |
+ 1 |
for Comment
veky: Nice check whether xor has <=1 set bit. :-) But... * range(0, len(image), 4) would probably be clear...
|
Nov. 23, 2017, 1:45 p.m. |
+ 1 |
for Comment
Sim0000: I have checked your code for all 5040 case. Then 5 case need 9 steps (5293, 9204, 9214, 9241, 9431).
|
Nov. 23, 2017, 1:45 p.m. |
+ 1 |
for Comment
veky: Even better. :-) Though, you don't have to listify all your generators, iterators are often complete...
|
Nov. 23, 2017, 1:44 p.m. |
+ 1 |
for Comment
veky: You still use sorted in a weird way. :-) Line 10 is just points = sorted(data). Line 16, sort has a ...
|
Sept. 21, 2014, 4:41 p.m. |
+ 1 |
for Comment
veky: Don't write empty except. It almost never means what you think it means. For example, imagine someon...
|
Sept. 21, 2014, 4:34 p.m. |
+ 1 |
for Comment
veky: Now you're just showing off. But I like it. :-D
|
Sept. 19, 2014, 9:28 p.m. |
+ 1 |
for Comment
veky: Nice twist. You could have gotten away with slicing (or re.sub), instead of that boring replace. ;-)
|
Sept. 19, 2014, 9:18 p.m. |
+ 1 |
for Comment
veky: ROT13 effect in line 5 is really nice artefact. ;-D But I'm confused... of five lines, you spend one...
|
June 29, 2014, 9:16 p.m. |
+ 1 |
for Comment
veky: May I ask why importing two modules, when simple builtin sum would have sufficed? Yes, solution is s...
|
May 23, 2014, 9:32 a.m. |
+ 1 |
for Comment
veky: Counter has <= (subset). You can use it instead of having that c.
|
April 13, 2014, 10:41 a.m. |
+ 1 |
for Comment
veky: Obvious. :-P Nitpick: you don't need 0 in slice [:1]... which makes a nice symmetry, p[:i] up to i, ...
|
April 12, 2014, 8:02 p.m. |
+ 1 |
for Comment
veky: BFS. Nice but a bit boring. :-)
|
April 11, 2014, 12:27 p.m. |
+ 1 |
for Comment
veky: Explicit is better than implicit, even when it comes to recursion stack? :-D
|