Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042720399399620%4.8Mediumen
Calculator0.0053845138736%3.1Mediumen
Catalan Numbers0.0054541167237%3.2Mediumen
Chinese Remainder0.0055888159127%4.1Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054101146336%3.7Mediumen
Closest Pair0.068918407158619%6.6Harden
Closest Pair (Uniform)0.055708473236628%4.7Mediumen
Convex Hull0.0159615147400026%4.2Mediumen
Eulerian Path0.016174640136029%4.6Mediumen
Line Segment Distance0.00806219990041%4.2Mediumen
Line Segment Intersection0.006894724106222%6.7Harden
Linear Equation Solver0.018923532105830%5.8Harden
Maximum Flow0.0140214580416929%4.1Mediumen
Maximum Number of Colinear Points0.043762816110939%3.6Mediumen
Minimum Cost Maximum Flow0.0113774111152337%4.8Mediumen
Minimum Spanning Tree0.0435615860418826%3.8Mediumen
Modular Arithmetic0.002023389162748%2.9Mediumen
Partial Linear Equation Solver0.011452206138919%7.4Harden
Point in Polygon0.003785425144727%5.1Mediumen
Polygon Area0.001187072289841%2.2Easyen
Prime Sieve0.0026613045426433%4.6Mediumen
Rational Arithmetic0.00646738211131%3.4Mediumen
Single source shortest path, negative weights0.0139614045322223%3.7Mediumen
Single source shortest path, non-negative weights0.0233127012846831%3.2Mediumen
Single source shortest path, time table0.013787405235532%3.1Mediumen
String Matching0.0117311580372632%3.6Mediumen
String Multimatching0.104166139159526%5.6Harden
Suffix Sorting0.023074269141933%5.3Mediumen