Série 4 - Programmation dynamique et algorithmes gloutons, Gr. 01
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Planting Trees | 15/45 (33%) | 2.50 | 2.40 |
| B | Single source shortest path, non-negative weights | 6/51 (12%) | 3.40 | 2.67 |
| C | Knapsack | 7/99 (7%) | 6.19 | 6.57 |