USC ICPC Practice: Dynamic Programming Practice II
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Walrus Weights | 3/3 (100%) | 1.00 | 1.00 |
| B | Knapsack | 0/6 (0%) | 2.00 | -- |
| C | Cent Savings | 3/9 (33%) | 2.25 | 2.33 |
| D | Train Sorting | 1/6 (17%) | 2.00 | 4.00 |
| E | NTNU Orienteering | 0/0 (0%) | -- | -- |
| F | Buggy Robot | 0/0 (0%) | -- | -- |
| G | Longest Common Subsequence | 0/1 (0%) | 1.00 | -- |
| H | Bridge Automation | 0/0 (0%) | -- | -- |