Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042719149374020%5.8Harden
Calculator0.0053669132536%3.0Mediumen
Catalan Numbers0.0054249161738%3.6Mediumen
Chinese Remainder0.0055681156428%4.7Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0053864140136%3.9Mediumen
Closest Pair0.0610997471138319%7.2Harden
Closest Pair (Uniform)0.055708042220027%4.5Mediumen
Convex Hull0.0164414016369126%4.4Mediumen
Eulerian Path0.016174320125229%5.8Harden
Line Segment Distance0.00871209984740%4.3Mediumen
Line Segment Intersection0.006894535100522%6.5Harden
Linear Equation Solver0.018923450101830%6.2Harden
Maximum Flow0.0140213839411130%4.3Mediumen
Maximum Number of Colinear Points0.04376261898438%4.6Mediumen
Minimum Cost Maximum Flow0.0113773918146137%5.0Mediumen
Minimum Spanning Tree0.0435615064396726%4.4Mediumen
Modular Arithmetic0.002173260156448%3.0Mediumen
Partial Linear Equation Solver0.011452200438619%7.5Harden
Point in Polygon0.003785307138026%5.8Harden
Polygon Area0.001186749274741%2.6Easyen
Prime Sieve0.0026612755414633%4.8Mediumen
Rational Arithmetic0.00646664209631%3.4Mediumen
Single source shortest path, negative weights0.0139613201300223%4.2Mediumen
Single source shortest path, non-negative weights0.0233125487796331%2.9Mediumen
Single source shortest path, time table0.013786996216631%3.7Mediumen
String Matching0.0117710711346232%3.8Mediumen
String Multimatching0.104165697144625%5.9Harden
Suffix Sorting0.023073913129833%5.5Harden