Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042721510424120%4.3Mediumen
Calculator0.0054036144536%3.0Mediumen
Catalan Numbers0.0054870183538%3.2Mediumen
Chinese Remainder0.0056237174528%3.7Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054283156437%3.4Mediumen
Closest Pair0.055729558181919%6.5Harden
Closest Pair (Uniform)0.035708848253029%4.5Mediumen
Convex Hull0.0159615911422627%4.1Mediumen
Eulerian Path0.016174757138829%4.7Mediumen
Line Segment Distance0.00404240898841%3.8Mediumen
Line Segment Intersection0.006895177115722%6.2Harden
Linear Equation Solver0.018923725110630%5.4Mediumen
Maximum Flow0.0140215509457429%4.2Mediumen
Maximum Number of Colinear Points0.043762957117140%3.4Mediumen
Minimum Cost Maximum Flow0.0113774320158437%5.0Mediumen
Minimum Spanning Tree0.0335616568446227%3.5Mediumen
Modular Arithmetic0.001983738179248%2.8Mediumen
Partial Linear Equation Solver0.011070214541819%7.3Harden
Point in Polygon0.003785671152327%4.9Mediumen
Polygon Area0.001187352304441%2.1Easyen
Prime Sieve0.0023614063448932%4.2Mediumen
Rational Arithmetic0.00647288228131%3.2Mediumen
Single source shortest path, negative weights0.0039614725342523%3.7Mediumen
Single source shortest path, non-negative weights0.0133128466894631%2.8Mediumen
Single source shortest path, time table0.013787673244932%2.8Mediumen
String Matching0.0117312231393632%3.3Mediumen
String Multimatching0.104166429166726%5.4Mediumen
Suffix Sorting0.023074500147933%5.2Mediumen