Practice 10.19.2011

For practice we have OJ, cereal bars, candy, dried fruit.  No donuts or bananas this time, will have them for Saturday.

1st/2nd hour work on the following dynamic programming problems (thanks to Tim for finding these):

Optimal array multiplication: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=284

Coin makeup: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=293

3rd hour: discuss solutions found, create teams. register folks on ACM site.