2 Aug 2002 fxn   » (Master)

Wow, the TPR(0,4c) has started very strong. I've checked for about 50 solutions today in five hours. There are some amazingly clever solutions.

There are two holes in this tournament: finding the rightmost non-zero digit of a factorial, and computing the postorder, given the preorder and inorder of a binary tree. Best solutions right now use 48 and 50 keystrokes respectively.

Thanks goodness for -MO=Deparse.

Latest blog entries     Older blog entries

New Advogato Features

New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.

Keep up with the latest Advogato features by reading the Advogato status blog.

If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!