Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042721228415420%4.8Mediumen
Calculator0.0053992142536%3.1Mediumen
Catalan Numbers0.0054846182638%3.3Mediumen
Chinese Remainder0.0056162171828%3.8Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054229153736%3.6Mediumen
Closest Pair0.055728873172619%6.6Harden
Closest Pair (Uniform)0.035708663246028%4.6Mediumen
Convex Hull0.0159615539411026%4.3Mediumen
Eulerian Path0.016174741138529%4.6Mediumen
Line Segment Distance0.00806225191641%4.1Mediumen
Line Segment Intersection0.006894920109922%6.6Harden
Linear Equation Solver0.018923700110330%5.4Mediumen
Maximum Flow0.0140215342451629%4.0Mediumen
Maximum Number of Colinear Points0.043762858112839%3.5Mediumen
Minimum Cost Maximum Flow0.0113774233157337%4.8Mediumen
Minimum Spanning Tree0.0335616400442027%3.7Mediumen
Modular Arithmetic0.001983618172748%3.0Mediumen
Partial Linear Equation Solver0.011070213141620%7.3Harden
Point in Polygon0.003785501147627%5.0Mediumen
Polygon Area0.001187202296141%2.2Easyen
Prime Sieve0.0025113866442932%4.3Mediumen
Rational Arithmetic0.00646905217331%3.5Mediumen
Single source shortest path, negative weights0.0039614547338123%3.6Mediumen
Single source shortest path, non-negative weights0.0133127776877432%2.8Mediumen
Single source shortest path, time table0.013787624242432%2.9Mediumen
String Matching0.0117312031383932%3.9Mediumen
String Multimatching0.104166315163126%5.5Harden
Suffix Sorting0.023074406143733%5.3Mediumen