Projects Round 1

Problems

Name Solved / Tries Average tries Average tries to solve
A Travelling Salesperson 2D 27/124 (22%) 4.59 4.59
B Sublinear Algorithms: Minimum Spanning Forest 1/77 (1%) 38.50 76.00