s18-04 Dynamic programming 1
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Maximizing (And Minimizing) Your Winnings | 35/127 (28%) | 3.43 | 3.43 |
| B | Memory Game | 8/48 (17%) | 3.69 | 4.25 |
| C | Muzicari | 41/235 (17%) | 5.60 | 5.39 |
| D | Train Sorting | 24/284 (8%) | 8.61 | 9.88 |