Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042721757429220%4.1Mediumen
Calculator0.0054189147735%3.2Mediumen
Catalan Numbers0.0054929185438%3.1Mediumen
Chinese Remainder0.0056297177928%3.6Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054382159336%3.4Mediumen
Closest Pair0.055729748185919%6.4Harden
Closest Pair (Uniform)0.035708944256629%4.5Mediumen
Convex Hull0.0159616296434827%3.7Mediumen
Eulerian Path0.016174895143329%4.5Mediumen
Line Segment Distance0.004042493102041%3.7Mediumen
Line Segment Intersection0.006895331119622%6.1Harden
Linear Equation Solver0.018923745111430%5.2Mediumen
Maximum Flow0.0140215650461129%4.2Mediumen
Maximum Number of Colinear Points0.033763085123640%3.2Mediumen
Minimum Cost Maximum Flow0.0113774366159236%4.9Mediumen
Minimum Spanning Tree0.0335616741454027%3.3Mediumen
Modular Arithmetic0.001883831182748%2.8Mediumen
Partial Linear Equation Solver0.011070217642620%7.2Harden
Point in Polygon0.003785779155427%4.8Mediumen
Polygon Area0.001187433309842%2.1Easyen
Prime Sieve0.0023614255452632%4.2Mediumen
Rational Arithmetic0.00647344229831%3.1Mediumen
Single source shortest path, negative weights0.0039614977353424%3.3Mediumen
Single source shortest path, non-negative weights0.0133128835907231%2.6Easyen
Single source shortest path, time table0.013787727247432%2.7Easyen
String Matching0.0117312393399632%3.2Mediumen
String Multimatching0.104166491168526%5.3Mediumen
Suffix Sorting0.023074545150033%5.0Mediumen