Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003893049225374%3.2Mediumen
Calculator0.00271412115482%3.2Mediumen
Catalan Numbers0.00621459121483%3.1Mediumen
Chinese Remainder0.001011312104880%3.2Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.001611183100085%3.0Mediumen
Closest Pair0.05572127668854%5.7Harden
Closest Pair (Uniform)0.03312118986072%3.4Mediumen
Convex Hull0.015963249243175%2.7Easyen
Eulerian Path0.0161772557780%4.3Mediumen
Line Segment Distance0.0040480268686%3.3Mediumen
Line Segment Intersection0.0068976355773%5.6Harden
Linear Equation Solver0.0189249738577%4.9Mediumen
Maximum Flow0.014022026154076%3.5Mediumen
Maximum Number of Colinear Points0.0337171361286%2.9Mediumen
Minimum Cost Maximum Flow0.01137764253083%4.6Mediumen
Minimum Spanning Tree0.023562713223482%2.9Mediumen
Modular Arithmetic0.001881360118887%2.4Easyen
Partial Linear Equation Solver0.01107028818062%7.0Harden
Point in Polygon0.00378100978978%4.5Mediumen
Polygon Area0.001182518222888%2.0Easyen
Prime Sieve0.002362703199374%4.3Mediumen
Rational Arithmetic0.00641603136585%3.1Mediumen
Single source shortest path, negative weights0.002382250179880%2.5Easyen
Single source shortest path, non-negative weights0.012514894411484%2.2Easyen
Single source shortest path, time table0.012941408122987%2.5Easyen
String Matching0.011732757215778%3.1Mediumen
String Multimatching0.1041696169172%4.5Mediumen
Suffix Sorting0.0230787566176%4.6Mediumen