Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003892891210773%3.8Mediumen
Calculator0.00271397114382%3.1Mediumen
Catalan Numbers0.00621442120083%3.0Mediumen
Chinese Remainder0.001011282102280%3.3Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.00161116598284%3.2Mediumen
Closest Pair0.05572125266853%6.0Harden
Closest Pair (Uniform)0.03312114782172%3.5Mediumen
Convex Hull0.015963100229574%3.2Mediumen
Eulerian Path0.0161772457680%4.3Mediumen
Line Segment Distance0.0040474863785%3.4Mediumen
Line Segment Intersection0.0068974454173%5.8Harden
Linear Equation Solver0.0189249238077%5.1Mediumen
Maximum Flow0.014021987150876%3.4Mediumen
Maximum Number of Colinear Points0.0337169859786%3.0Mediumen
Minimum Cost Maximum Flow0.01137763251982%4.6Mediumen
Minimum Spanning Tree0.033562692221682%2.9Mediumen
Modular Arithmetic0.001881251108587%2.6Easyen
Partial Linear Equation Solver0.01107028417762%7.0Harden
Point in Polygon0.0037899077278%4.6Mediumen
Polygon Area0.001182495220588%2.0Easyen
Prime Sieve0.002362691198674%4.2Mediumen
Rational Arithmetic0.00641598136085%3.1Mediumen
Single source shortest path, negative weights0.003962109165979%2.9Mediumen
Single source shortest path, non-negative weights0.013314779399984%2.5Easyen
Single source shortest path, time table0.013781384120687%2.6Easyen
String Matching0.011732726213078%3.1Mediumen
String Multimatching0.1041694768072%4.4Mediumen
Suffix Sorting0.0230785564375%4.8Mediumen