Projects Round 1
Problems
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 0/0 (0) | -- | -- |
| B | Travelling Salesperson 2D | 0/0 (0) | -- | -- |
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 0/0 (0) | -- | -- |
| B | Travelling Salesperson 2D | 0/0 (0) | -- | -- |