 |
 |
Problem Detail | |
| Problem Name: | HamiltonianTree |
| Used In: | TCO19 Fun Round 4 |
| Used As: | Division I Level Three |
| Categories: | Graph Theory, Math, Recursion, Search |
| Writer: | misof |
| Tester: | Unknown |
|
|
| Division I | |
| Point Value | 1000 |
| Competitors | 66 |
| Opens | 23 |
| Percent Open | 34.85% |
| Percent Submitted | 4.35% |
| Overall Accuracy | 1.52% |
| Division I | ||||||
| Java | C++ | C# | VB | Python | Overall | |
| Problems Submitted | 0 | 1 | 0 | 0 | 0 | 1 |
| Problems Correct | 0 | 1 | 0 | 0 | 0 | 1 |
| Submission Accuracy | 0.00 | 100.00% | 0.00 | 0.00 | 0.00 | 100.00% |
| Problems Failed by Challenge | 0 | 0 | 0 | 0 | 0 | 0 |
| Problems Failed by System Test | 0 | 0 | 0 | 0 | 0 | 0 |
| 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:32:18.879 | 0:32:18.879 | ||||
| Fastest | tourist | tourist | ||||
| Top Submission | view | view | ||||
| Average Correct Time | 0:32:18.879 | 0:32:18.879 | ||||