OpenKattis
Linköping University

Problems

Submissions Users
Name   Total Acc. Ratio Fastest Total Acc. Ratio
All Pairs Shortest Path 640 130 20% 0.03 66 49 74%
Eulerian Path 239 80 33% 0.03 32 24 75%
Maximum Flow 834 202 24% 0.01 74 56 76%
Minimum Cost Maximum Flow 179 33 18% 0.42 21 14 67%
Minimum Cut 159 75 47% 0.01 40 37 92%
Minimum Spanning Tree 687 218 32% 0.05 88 78 89%
Single source shortest path, negative weights 791 166 21% 0.04 78 64 82%
Single source shortest path, non-negative weights 1103 312 28% 0.04 103 94 91%
Single source shortest path, time table 374 144 39% 0.02 74 65 88%