Dynamic programming 1
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Constrained Freedom of Choice | 22/119 (18%) | 4.25 | 4.32 |
| B | Witchwood | 3/4 (75%) | 1.33 | 1.33 |
| C | Excavator Expedition | 27/372 (7%) | 12.00 | 9.56 |
| D | Train Sorting | 11/157 (7%) | 9.24 | 5.64 |
| E | Knapsack | 0/0 (0%) | -- | -- |