Projects Round 1
Problems
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 29686/2839 (10) | 109.19 | 148.76 |
| B | Travelling Salesperson 2D | 1648/4185 (0) | 41.03 | 43.84 |
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 29686/2839 (10) | 109.19 | 148.76 |
| B | Travelling Salesperson 2D | 1648/4185 (0) | 41.03 | 43.84 |