JOIN
Get Time

   Problem Detail  
Problem Name: HamiltonianTree
Used In: TCO19 Round 4
Used As: Division I Level Three
Categories: Graph Theory, Math, Recursion, Search
Writer: misof
Tester: Unknown

Division I
Point Value 1000
Competitors 96
Opens 65
Percent Open 67.71%
Percent Submitted 9.23%
Overall Accuracy 4.17%

Division I
Java C++ C# VB Python Overall
Problems Submitted 1 5 0 0 0 6
Problems Correct 1 3 0 0 0 4
Submission Accuracy 100.00% 60.00% 0.00 0.00 0.00 66.67%
Problems Failed by Challenge 0 0 0 0 0 0
Problems Failed by System Test 0 2 0 0 0 2
Challenge Attempts Made 0 0 0 0 0 0
Challenge Accuracy 0.00% 0.00% 0.00 0.00 0.00 0.00%
Best Time 0:58:42.865 0:38:44.975 0:38:44.975
Fastest eatmore Um_nik Um_nik
Top Submission view view view
Average Correct Time 0:58:42.865 0:51:23.64 0:53:13.14