Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003893029223474%3.2Mediumen
Calculator0.00271407115182%3.2Mediumen
Catalan Numbers0.00621456121183%3.1Mediumen
Chinese Remainder0.001011303104180%3.1Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.00161117699384%3.1Mediumen
Closest Pair0.05572126567754%5.8Harden
Closest Pair (Uniform)0.03312115482772%3.7Mediumen
Convex Hull0.015963223240775%2.8Mediumen
Eulerian Path0.0161772457680%4.3Mediumen
Line Segment Distance0.0040479468186%3.2Mediumen
Line Segment Intersection0.0068975555173%5.5Harden
Linear Equation Solver0.0189249538377%5.0Mediumen
Maximum Flow0.014022018153276%3.5Mediumen
Maximum Number of Colinear Points0.0337170560486%3.0Mediumen
Minimum Cost Maximum Flow0.01137763852682%4.5Mediumen
Minimum Spanning Tree0.033562708223082%2.9Mediumen
Modular Arithmetic0.001881350118087%2.4Easyen
Partial Linear Equation Solver0.01107028617963%7.0Harden
Point in Polygon0.00378100378378%4.5Mediumen
Polygon Area0.001182505221588%2.0Easyen
Prime Sieve0.002362698199074%4.2Mediumen
Rational Arithmetic0.00641599136185%3.1Mediumen
Single source shortest path, negative weights0.002382223177180%2.6Easyen
Single source shortest path, non-negative weights0.012514851407184%2.3Easyen
Single source shortest path, time table0.012941400122187%2.6Easyen
String Matching0.011732749215078%3.1Mediumen
String Multimatching0.1041695768772%4.5Mediumen
Suffix Sorting0.0230787365975%4.6Mediumen