Projects Round 1
Problems
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 22079/762 (29) | 42.33 | 61.42 |
| B | Travelling Salesperson 2D | 1084/1913 (1) | 39.04 | 39.04 |
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 22079/762 (29) | 42.33 | 61.42 |
| B | Travelling Salesperson 2D | 1084/1913 (1) | 39.04 | 39.04 |