# Problems

Submissions | Users | ||||||||
---|---|---|---|---|---|---|---|---|---|

Name | Total | Acc. | Ratio | Fastest | Total | Acc. | Ratio | ||

All Pairs Shortest Path | 635 | 125 | 20% | 0.03 | 66 | 49 | 74% | ||

Eulerian Path | 232 | 76 | 33% | 0.03 | 31 | 23 | 74% | ||

Maximum Flow | 767 | 185 | 24% | 0.01 | 70 | 53 | 76% | ||

Minimum Cost Maximum Flow | 171 | 26 | 15% | 0.42 | 21 | 14 | 67% | ||

Minimum Cut | 156 | 72 | 46% | 0.01 | 40 | 37 | 92% | ||

Minimum Spanning Tree | 642 | 199 | 31% | 0.05 | 85 | 76 | 89% | ||

Single source shortest path, negative weights | 721 | 156 | 22% | 0.04 | 75 | 61 | 81% | ||

Single source shortest path, non-negative weights | 1058 | 286 | 27% | 0.04 | 101 | 91 | 90% | ||

Single source shortest path, time table | 351 | 131 | 37% | 0.02 | 72 | 63 | 88% |