Here is the homework problem for this week: http://www.usaco.org/index.php?page=viewproblem2&cpid=1012. This problem is algorithmic, and it is known as a greedy problem, where the solution is to take the best move at every step.
top of page
bottom of page