Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042721833430720%4.0Mediumen
Calculator0.0054191147935%3.2Mediumen
Catalan Numbers0.0054931185638%3.1Mediumen
Chinese Remainder0.0056320178828%3.6Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054397159836%3.4Mediumen
Closest Pair0.055729760186319%6.4Harden
Closest Pair (Uniform)0.035708944256629%4.5Mediumen
Convex Hull0.0159616363436627%3.6Mediumen
Eulerian Path0.016174895143329%4.5Mediumen
Line Segment Distance0.004042495102241%3.7Mediumen
Line Segment Intersection0.006895331119622%6.1Harden
Linear Equation Solver0.018923745111430%5.2Mediumen
Maximum Flow0.0140215678461529%4.1Mediumen
Maximum Number of Colinear Points0.033763087123840%3.2Mediumen
Minimum Cost Maximum Flow0.0113774367159236%4.9Mediumen
Minimum Spanning Tree0.0335616761455027%3.2Mediumen
Modular Arithmetic0.001883867184148%2.8Mediumen
Partial Linear Equation Solver0.011070217642620%7.2Harden
Point in Polygon0.003785783155827%4.7Mediumen
Polygon Area0.001187451310242%2.0Easyen
Prime Sieve0.0023614292454432%4.3Mediumen
Rational Arithmetic0.00647346230031%3.0Mediumen
Single source shortest path, negative weights0.0039615002355124%3.2Mediumen
Single source shortest path, non-negative weights0.0133128858908331%2.6Easyen
Single source shortest path, time table0.013787730247632%2.7Easyen
String Matching0.0117312414400832%3.2Mediumen
String Multimatching0.104166616175226%4.5Mediumen
Suffix Sorting0.023074549150333%4.9Mediumen