0.2 Classics (can do)
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Single source shortest path, non-negative weights | 1/1 (100%) | 1.00 | 1.00 |
| B | Minimum Spanning Tree | 1/1 (100%) | 1.00 | 1.00 |
| C | Knapsack | 2/2 (100%) | 1.00 | 1.00 |
| D | Longest Increasing Subsequence | 0/0 (0%) | -- | -- |
| E | Minimum Cut | 0/0 (0%) | -- | -- |
| F | Maximum Flow | 0/1 (0%) | 1.00 | -- |
| G | Polynomial Multiplication 1 | 0/0 (0%) | -- | -- |
| H | Polynomial Multiplication 2 | 0/0 (0%) | -- | -- |