Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003893025223274%3.2Mediumen
Calculator0.00271404114882%3.2Mediumen
Catalan Numbers0.00621456121183%3.1Mediumen
Chinese Remainder0.001011301103980%3.2Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.00161117599284%3.1Mediumen
Closest Pair0.05572126567754%5.8Harden
Closest Pair (Uniform)0.03312115382672%3.7Mediumen
Convex Hull0.015963218240375%2.8Mediumen
Eulerian Path0.0161772457680%4.3Mediumen
Line Segment Distance0.0040478367086%3.3Mediumen
Line Segment Intersection0.0068975455073%5.6Harden
Linear Equation Solver0.0189249438277%5.0Mediumen
Maximum Flow0.014022017153176%3.5Mediumen
Maximum Number of Colinear Points0.0337170560486%3.0Mediumen
Minimum Cost Maximum Flow0.01137763852682%4.5Mediumen
Minimum Spanning Tree0.033562707222982%2.9Mediumen
Modular Arithmetic0.001881350118087%2.4Easyen
Partial Linear Equation Solver0.01107028517862%7.0Harden
Point in Polygon0.00378100178278%4.5Mediumen
Polygon Area0.001182504221488%2.0Easyen
Prime Sieve0.002362697198974%4.3Mediumen
Rational Arithmetic0.00641599136185%3.1Mediumen
Single source shortest path, negative weights0.002382221176980%2.6Easyen
Single source shortest path, non-negative weights0.012514841406184%2.3Easyen
Single source shortest path, time table0.012941399122087%2.6Easyen
String Matching0.011732747214878%3.1Mediumen
String Multimatching0.1041695568772%4.4Mediumen
Suffix Sorting0.0230787365975%4.6Mediumen