Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042720510401720%4.7Mediumen
Calculator0.0053845138736%3.1Mediumen
Catalan Numbers0.0054551167837%3.2Mediumen
Chinese Remainder0.0055931160027%4.1Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054117146936%3.6Mediumen
Closest Pair0.068918461159819%6.5Harden
Closest Pair (Uniform)0.055708489237428%4.6Mediumen
Convex Hull0.0159615197401626%4.2Mediumen
Eulerian Path0.016174651136229%4.7Mediumen
Line Segment Distance0.00806220890241%4.2Mediumen
Line Segment Intersection0.006894806107922%6.6Harden
Linear Equation Solver0.018923576106630%5.7Harden
Maximum Flow0.0140214638418929%4.1Mediumen
Maximum Number of Colinear Points0.043762818111039%3.6Mediumen
Minimum Cost Maximum Flow0.0113774138154037%4.8Mediumen
Minimum Spanning Tree0.0335615958423027%3.8Mediumen
Modular Arithmetic0.002023404163548%2.9Mediumen
Partial Linear Equation Solver0.011452207339319%7.4Harden
Point in Polygon0.003785432145227%5.1Mediumen
Polygon Area0.001187086290641%2.2Easyen
Prime Sieve0.0026613088427533%4.6Mediumen
Rational Arithmetic0.00646738211131%3.4Mediumen
Single source shortest path, negative weights0.0139614113325023%3.6Mediumen
Single source shortest path, non-negative weights0.0233127078850631%3.1Mediumen
Single source shortest path, time table0.013787454237132%3.0Mediumen
String Matching0.0117311588373032%3.6Mediumen
String Multimatching0.104166159160226%5.5Harden
Suffix Sorting0.023074286142433%5.3Mediumen