Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042721883431220%4.1Mediumen
Calculator0.0054196148135%3.2Mediumen
Catalan Numbers0.0054933185738%3.1Mediumen
Chinese Remainder0.0056335179628%3.6Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054445161036%3.4Mediumen
Closest Pair0.055729794186719%6.4Harden
Closest Pair (Uniform)0.035708960257329%4.4Mediumen
Convex Hull0.0159616428438327%3.6Mediumen
Eulerian Path0.016174924143429%4.5Mediumen
Line Segment Distance0.004042512103241%3.6Mediumen
Line Segment Intersection0.006895384120422%6.1Harden
Linear Equation Solver0.018923749111730%5.2Mediumen
Maximum Flow0.0140215712462229%4.0Mediumen
Maximum Number of Colinear Points0.033713107124440%3.1Mediumen
Minimum Cost Maximum Flow0.0113774376159636%4.9Mediumen
Minimum Spanning Tree0.0335616807456827%3.1Mediumen
Modular Arithmetic0.001883882184648%2.8Mediumen
Partial Linear Equation Solver0.011070218442920%7.1Harden
Point in Polygon0.003785803156127%4.7Mediumen
Polygon Area0.001187462310842%2.0Easyen
Prime Sieve0.0023614314454732%4.2Mediumen
Rational Arithmetic0.00647367230431%3.1Mediumen
Single source shortest path, negative weights0.0039615094358224%3.1Mediumen
Single source shortest path, non-negative weights0.0133128944912332%2.5Easyen
Single source shortest path, time table0.013787749248532%2.7Easyen
String Matching0.0117312429401432%3.1Mediumen
String Multimatching0.104166677177027%4.4Mediumen
Suffix Sorting0.023074549150333%4.8Mediumen