Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003893062226774%3.1Mediumen
Calculator0.00271416115682%3.3Mediumen
Catalan Numbers0.00621464121883%3.1Mediumen
Chinese Remainder0.001011319105380%3.2Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.001611188100585%3.0Mediumen
Closest Pair0.05572128068854%5.7Harden
Closest Pair (Uniform)0.03312120587272%3.4Mediumen
Convex Hull0.015963298247675%2.7Easyen
Eulerian Path0.0161772657880%4.3Mediumen
Line Segment Distance0.0040480869186%3.3Mediumen
Line Segment Intersection0.0068976756173%5.5Harden
Linear Equation Solver0.0189250338977%4.9Mediumen
Maximum Flow0.014022041155576%3.3Mediumen
Maximum Number of Colinear Points0.0337171761686%2.9Mediumen
Minimum Cost Maximum Flow0.01137764653483%4.5Mediumen
Minimum Spanning Tree0.023562721224182%2.9Mediumen
Modular Arithmetic0.001881369119587%2.4Easyen
Partial Linear Equation Solver0.01107029318463%7.0Harden
Point in Polygon0.00378101279278%4.4Mediumen
Polygon Area0.001182531224089%2.0Easyen
Prime Sieve0.002362704199374%4.4Mediumen
Rational Arithmetic0.00641609137185%3.0Mediumen
Single source shortest path, negative weights0.002382255180380%2.5Easyen
Single source shortest path, non-negative weights0.012514904412284%2.2Easyen
Single source shortest path, time table0.012941410123187%2.5Easyen
String Matching0.011732762216278%3.1Mediumen
String Multimatching0.1041696369372%4.5Mediumen
Suffix Sorting0.0230787766275%4.6Mediumen