Projects Round 2

Problems

Name Solved / Tries Average tries Average tries to solve
A Sublinear Algorithms: Minimum Spanning Forest 22/1036 (2%) 28.00 29.59
B Travelling Salesperson 2D 86/280 (31%) 3.01 3.01