The odd thing is, though, I still don't really see how you can solve C-small without solving C-large at the same time (other than actual brute-force). Guess I'll be keeping my eyes peeled for the write-up.
Yeah, that disclaimer scared me off at first. I solved D last, but in the end I do feel that it's easier than C. I suppose you can solve C-small with a more naive method though.
That's what I thought initially as well, but in the end I ended up solving more than last year or the year before. I felt like I wasn't going to get anything after A and B at first, though.
I couldn't seem to get this compiled on OSX :( Do you (or anyone) know if there's a OSX version available? What I like about ncp is that it first requires an action at the sender (push) and then at the receiver afterwards (poll).
Imagine this design with poorly filtered instagram pictures and fishy facebook application ads all over the place, instead of brilliantly lighted professional photographs of beautiful women.
It's a great work of art from a design perspective, but quite unfeasible to turn into the real thing.