mlgh

Now you can annoy curl users by putting null byte in the beginning of the document.

Sorry, but the implementation posted is O(|pattern| * |name|), not linear. http://ideone.com/2xCXyY

Thank you! After reading blog-post I had zero understanding of what the problem is about and how they solve it. Tried to read again - no luck. Then I opened codejam link and saw that it's basically about placing maximum amount of bishops using maximum matching. (Other parts of problem are trivial)

That's really sad that this pattern of bad explanations is so frequent in the internet.

Ah, got it: http://jsfiddle.net/h2yJn/2968/embedded/result/ (though I felt that it's easier to use arrow keys for motion and W/A/S/D for expanding)

Sorry, what do you mean by motion and expanding numbers?

There are only 4 actions in this puzzle: expand to left, expand to right, expand up and expand bottom (and U for undo)

Here is version where you can also use W-A-S-D instead. http://jsfiddle.net/h2yJn/2966/embedded/result/

Also, if you manage to solve this puzzle, don't hesitate to post back on how you did it :) (e.g. pastebin the list of actions that is below the grid)

Direct link to the source if anyone wants to modify it somehow: http://jsfiddle.net/h2yJn/2966/

9/11

If you think that awesome wm is bloated, try dwm on which awesome wm was historically based. The key bindings look the same. After I've noticed that I haven't used 90% of awesome wm functionality, I moved to a dwm which is basically 2k lines of readable C code in a single file and never looked back - it's so easy to configure it to do exactly what you need.