avalg18
Problems
| Name | Solved / Tries | Average tries | Average tries to solve | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 24/2276 (1%) | 54.19 | 48.96 |
| B | Sublinear Algorithms: Minimum Spanning Forest with varying Parameters | 17/1015 (2%) | 33.83 | 36.24 |
| C | Travelling Salesperson 2D | 147/424 (35%) | 2.83 | 2.73 |