USC ICPC Practice 4: Dynamic Programming
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Walrus Weights | 3/5 (60%) | 1.25 | 1.33 |
| B | Knapsack | 1/7 (14%) | 1.75 | 1.00 |
| C | Cent Savings | 0/3 (0%) | 3.00 | -- |
| D | Train Sorting | 0/1 (0%) | 1.00 | -- |
| E | NTNU Orienteering | 0/0 (0%) | -- | -- |
| F | Buggy Robot | 0/0 (0%) | -- | -- |
| G | Longest Common Subsequence | 0/0 (0%) | -- | -- |
| H | Bridge Automation | 0/0 (0%) | -- | -- |