Projects Round 1
Problems
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 19164/2077 (9) | 98.90 | 181.00 |
| B | Travelling Salesperson 2D | 1310/3569 (0) | 50.99 | 52.29 |
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 19164/2077 (9) | 98.90 | 181.00 |
| B | Travelling Salesperson 2D | 1310/3569 (0) | 50.99 | 52.29 |