Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003893085229174%3.1Mediumen
Calculator0.00271416115682%3.2Mediumen
Catalan Numbers0.00621473122783%3.0Mediumen
Chinese Remainder0.001011328106380%3.1Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.001611210102785%3.0Mediumen
Closest Pair0.05572128669354%5.6Harden
Closest Pair (Uniform)0.03312120687272%3.4Mediumen
Convex Hull0.015963311248975%2.6Easyen
Eulerian Path0.0161773859080%4.1Mediumen
Line Segment Distance0.0040482871086%3.2Mediumen
Line Segment Intersection0.0068978257574%5.2Mediumen
Linear Equation Solver0.0189250939678%4.7Mediumen
Maximum Flow0.014022080159477%3.2Mediumen
Maximum Number of Colinear Points0.0337173663286%2.9Mediumen
Minimum Cost Maximum Flow0.01137765854583%4.5Mediumen
Minimum Spanning Tree0.023562760228083%2.7Easyen
Modular Arithmetic0.001881381120787%2.4Easyen
Partial Linear Equation Solver0.01107029718763%6.8Harden
Point in Polygon0.00378102380479%4.2Mediumen
Polygon Area0.001182545225489%1.9Easyen
Prime Sieve0.002362713200074%4.3Mediumen
Rational Arithmetic0.00641610137285%3.0Mediumen
Single source shortest path, negative weights0.002382285183380%2.4Easyen
Single source shortest path, non-negative weights0.012514943415984%2.2Easyen
Single source shortest path, time table0.012941421124387%2.4Easyen
String Matching0.011732790218878%3.0Mediumen
String Multimatching0.1041697970972%4.3Mediumen
Suffix Sorting0.0230788767376%4.5Mediumen