Projects Round 1
Problems
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 7667/380 (20) | 47.50 | 87.75 |
| B | Travelling Salesperson 2D | 111/116 (1) | 8.92 | 9.50 |
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 7667/380 (20) | 47.50 | 87.75 |
| B | Travelling Salesperson 2D | 111/116 (1) | 8.92 | 9.50 |