Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003893074228174%3.1Mediumen
Calculator0.00271415115582%3.2Mediumen
Catalan Numbers0.00621472122683%3.0Mediumen
Chinese Remainder0.001011319105480%3.2Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.001611207102485%3.0Mediumen
Closest Pair0.05572128669354%5.6Harden
Closest Pair (Uniform)0.03312120687272%3.4Mediumen
Convex Hull0.015963309248775%2.7Easyen
Eulerian Path0.0161773658880%4.2Mediumen
Line Segment Distance0.0040482670886%3.2Mediumen
Line Segment Intersection0.0068977957273%5.3Mediumen
Linear Equation Solver0.0189250739478%4.7Mediumen
Maximum Flow0.014022068158276%3.3Mediumen
Maximum Number of Colinear Points0.0337172962986%2.8Mediumen
Minimum Cost Maximum Flow0.01137765454083%4.5Mediumen
Minimum Spanning Tree0.023562746226683%2.8Mediumen
Modular Arithmetic0.001881375120087%2.4Easyen
Partial Linear Equation Solver0.01107029718763%6.9Harden
Point in Polygon0.00378102180279%4.2Mediumen
Polygon Area0.001182543225289%1.9Easyen
Prime Sieve0.002362709199874%4.4Mediumen
Rational Arithmetic0.00641610137285%3.0Mediumen
Single source shortest path, negative weights0.002382277182580%2.4Easyen
Single source shortest path, non-negative weights0.012514936415284%2.2Easyen
Single source shortest path, time table0.012941416123887%2.5Easyen
String Matching0.011732772217078%3.0Mediumen
String Multimatching0.1041696970072%4.3Mediumen
Suffix Sorting0.0230787566176%4.5Mediumen