Série 4 - Programmation dynamique et algorithmes gloutons, Gr. 02
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Planting Trees | 14/47 (30%) | 3.36 | 3.36 |
| B | Single source shortest path, non-negative weights | 9/43 (21%) | 3.31 | 1.56 |
| C | Knapsack | 9/70 (13%) | 5.38 | 3.44 |