Projects Round 1
Problems
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 5415/27 (201) | 5.40 | 7.00 |
| B | Travelling Salesperson 2D | 119/49 (2) | 4.45 | 4.56 |
| Name | Average score | Average tries | Average tries for full score | |
|---|---|---|---|---|
| A | Sublinear Algorithms: Minimum Spanning Forest | 5415/27 (201) | 5.40 | 7.00 |
| B | Travelling Salesperson 2D | 119/49 (2) | 4.45 | 4.56 |