Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.004272844206973%3.9Mediumen
Calculator0.00271379113082%3.1Mediumen
Catalan Numbers0.00621423118483%3.1Mediumen
Chinese Remainder0.001011262100279%3.4Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.00161115697484%3.2Mediumen
Closest Pair0.05572122764753%6.3Harden
Closest Pair (Uniform)0.03570105473470%4.5Mediumen
Convex Hull0.015963046224674%3.3Mediumen
Eulerian Path0.0161771857180%4.4Mediumen
Line Segment Distance0.0040471260685%3.5Mediumen
Line Segment Intersection0.0068973453673%5.9Harden
Linear Equation Solver0.0189248937777%5.1Mediumen
Maximum Flow0.014021940146175%4.1Mediumen
Maximum Number of Colinear Points0.0337168558686%3.1Mediumen
Minimum Cost Maximum Flow0.01137762351282%4.7Mediumen
Minimum Spanning Tree0.033562647217582%3.1Mediumen
Modular Arithmetic0.001881213104986%2.7Easyen
Partial Linear Equation Solver0.01107028217562%7.1Harden
Point in Polygon0.0037897976478%4.7Mediumen
Polygon Area0.001182458217288%2.0Easyen
Prime Sieve0.002362678197474%4.3Mediumen
Rational Arithmetic0.00641588135485%3.1Mediumen
Single source shortest path, negative weights0.003962007156978%3.1Mediumen
Single source shortest path, non-negative weights0.013314723395284%2.5Easyen
Single source shortest path, time table0.013781379120287%2.7Easyen
String Matching0.011732626205278%3.2Mediumen
String Multimatching0.1041692065872%4.3Mediumen
Suffix Sorting0.0230783863175%4.8Mediumen