Projects Round 1
Problems
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 6136/76 (81) | 8.44 | 13.33 |
| B | Travelling Salesperson 2D | 257/207 (1) | 10.89 | 11.71 |
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 6136/76 (81) | 8.44 | 13.33 |
| B | Travelling Salesperson 2D | 257/207 (1) | 10.89 | 11.71 |