Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042722154437820%3.8Mediumen
Calculator0.0054223150036%3.1Mediumen
Catalan Numbers0.0054950186638%3.0Mediumen
Chinese Remainder0.0056392183029%3.4Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054489163836%3.2Mediumen
Closest Pair0.055729898188719%6.2Harden
Closest Pair (Uniform)0.035709000258229%4.3Mediumen
Convex Hull0.0159616594443627%3.5Mediumen
Eulerian Path0.016174930143929%4.4Mediumen
Line Segment Distance0.004042589105541%3.5Mediumen
Line Segment Intersection0.006895527123822%5.9Harden
Linear Equation Solver0.018923751111830%5.1Mediumen
Maximum Flow0.0140215752464229%4.0Mediumen
Maximum Number of Colinear Points0.033713156127040%3.0Mediumen
Minimum Cost Maximum Flow0.0113774401160837%4.7Mediumen
Minimum Spanning Tree0.0335616916461127%3.1Mediumen
Modular Arithmetic0.001883918186748%2.7Easyen
Partial Linear Equation Solver0.011070218542920%7.1Harden
Point in Polygon0.003785818156927%4.6Mediumen
Polygon Area0.001187520313242%2.0Easyen
Prime Sieve0.0023614346455632%4.2Mediumen
Rational Arithmetic0.00647391231831%3.1Mediumen
Single source shortest path, negative weights0.0039615239362624%3.1Mediumen
Single source shortest path, non-negative weights0.0133129070917832%2.4Easyen
Single source shortest path, time table0.013787765249732%2.7Easyen
String Matching0.0117312482402632%3.1Mediumen
String Multimatching0.104166918186127%4.3Mediumen
Suffix Sorting0.023074566150833%4.8Mediumen