Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042721949432320%4.0Mediumen
Calculator0.0054200148335%3.2Mediumen
Catalan Numbers0.0054933185738%3.1Mediumen
Chinese Remainder0.0056356180728%3.6Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054452161636%3.3Mediumen
Closest Pair0.055729825187419%6.3Harden
Closest Pair (Uniform)0.035708960257329%4.4Mediumen
Convex Hull0.0159616486440227%3.5Mediumen
Eulerian Path0.016174924143429%4.5Mediumen
Line Segment Distance0.004042534104041%3.5Mediumen
Line Segment Intersection0.006895436122122%5.9Harden
Linear Equation Solver0.018923749111730%5.1Mediumen
Maximum Flow0.0140215712462229%4.0Mediumen
Maximum Number of Colinear Points0.033713130125440%3.1Mediumen
Minimum Cost Maximum Flow0.0113774378159736%4.7Mediumen
Minimum Spanning Tree0.0335616867458227%3.2Mediumen
Modular Arithmetic0.001883889185248%2.7Easyen
Partial Linear Equation Solver0.011070218442920%7.1Harden
Point in Polygon0.003785806156127%4.7Mediumen
Polygon Area0.001187472311042%2.0Easyen
Prime Sieve0.0023614314454732%4.2Mediumen
Rational Arithmetic0.00647374231031%3.0Mediumen
Single source shortest path, negative weights0.0039615109358724%3.1Mediumen
Single source shortest path, non-negative weights0.0133128998913231%2.5Easyen
Single source shortest path, time table0.013787754248832%2.7Easyen
String Matching0.0117312437401432%3.2Mediumen
String Multimatching0.104166687177727%4.3Mediumen
Suffix Sorting0.023074549150333%4.8Mediumen