Problems from KTH CSC Popup 2005

Languages
All Pairs Shortest Path0.0045917788343319%5.6Harden
Calculator0.00133362120836%3.3Mediumen
Catalan Numbers0.00623885148738%3.9Mediumen
Chinese Remainder0.001015176139927%5.1Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.002473476126937%4.1Mediumen
Closest Pair0.0610996680118818%7.4Harden
Closest Pair (Uniform)0.055996814191828%5.9Harden
Convex Hull0.0164412299326727%4.4Mediumen
Eulerian Path0.0110034077118029%6.0Harden
Line Segment Distance0.00871189177441%4.4Mediumen
Line Segment Intersection0.001366404989722%6.7Harden
Linear Equation Solver0.01892327397030%6.4Harden
Maximum Flow0.0174811826352530%4.9Mediumen
Maximum Number of Colinear Points0.04376234888037%4.7Mediumen
Minimum Cost Maximum Flow0.0113853487127337%5.3Mediumen
Minimum Spanning Tree0.0435613766358426%4.6Mediumen
Modular Arithmetic0.002572908138948%3.3Mediumen
Partial Linear Equation Solver0.011452190536319%7.7Harden
Point in Polygon0.003784964128226%5.8Harden
Polygon Area0.001186204250940%3.0Mediumen
Prime Sieve0.0030211759388833%5.0Mediumen
Rational Arithmetic0.00646359197531%3.7Mediumen
Single source shortest path, negative weights0.0139612007271123%4.8Mediumen
Single source shortest path, non-negative weights0.0233123346718631%3.2Mediumen
Single source shortest path, time table0.013786292198332%4.0Mediumen
String Matching0.011779532314533%4.6Mediumen
String Multimatching0.104605177126324%7.2Harden
Suffix Sorting0.023073583116332%5.9Harden