TC CsCourses
From Algorithmist
[edit] Summary
Compute the lexicographically-minimal way to graduate! A relatively straightforward dynamic programming problem with backtracking. A little thinking gets the time down to O(n4) which is enough for n = 50.
From TopCoder Single Round Match 340.
