Projects Round 2

Problems

Name Solved / Tries Average tries Average tries to solve
A Sublinear Algorithms: Minimum Spanning Forest 9/268 (3%) 13.40 13.89
B Travelling Salesperson 2D 44/105 (42%) 2.10 1.95