|
|
Problem Name:
|
Diophantine
|
Used In:
|
TCO19 Wildcard
|
Used As:
|
Division I Level Two
|
Categories:
|
Dynamic Programming, Math, Search, Sorting
|
Writer:
|
misof
|
Tester:
|
Unknown
|
|
|
|
Division I
|
Point Value
|
600
|
Competitors
|
28
|
Opens
|
23
|
Percent Open
|
82.14%
|
Percent Submitted
|
39.13%
|
Overall Accuracy
|
21.43%
|
|
Division I |
|
Java
|
C++
|
C#
|
VB
|
Python
|
Overall |
Problems Submitted |
1
|
7
|
1
|
0
|
0
|
9
|
Problems Correct |
1
|
4
|
1
|
0
|
0
|
6
|
Submission Accuracy |
100.00%
|
57.14%
|
100.00%
|
0.00
|
0.00
|
66.67%
|
Problems Failed by Challenge |
0
|
2
|
0
|
0
|
0
|
2
|
Problems Failed by System Test |
0
|
1
|
0
|
0
|
0
|
1
|
Challenge Attempts Made |
0
|
3
|
0
|
0
|
0
|
3
|
Challenge Accuracy |
0.00%
|
66.67%
|
0.00%
|
0.00
|
0.00
|
66.67%
|
Best Time |
0:17:57.182
|
0:12:38.74
|
0:26:13.481
|
|
|
0:12:38.74
|
Fastest |
uwi
|
xudyh
|
rian
|
|
|
xudyh
|
Top Submission |
view
|
view
|
view
|
|
|
view
|
Average Correct Time |
0:17:57.182
|
0:24:06.678
|
0:26:13.481
|
|
|
0:23:26.229
|
|
|
|
|
|