Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042719878388220%5.1Mediumen
Calculator0.0053733136136%2.9Mediumen
Catalan Numbers0.0054186156137%3.4Mediumen
Chinese Remainder0.0055811156027%4.2Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054016143836%3.6Mediumen
Closest Pair0.068918282156919%6.6Harden
Closest Pair (Uniform)0.055708444236028%4.6Mediumen
Convex Hull0.0159614638387126%3.9Mediumen
Eulerian Path0.016174616134929%4.6Mediumen
Line Segment Distance0.00806214487441%4.2Mediumen
Line Segment Intersection0.006894571102222%6.7Harden
Linear Equation Solver0.018923507104830%5.9Harden
Maximum Flow0.0140213879400929%4.6Mediumen
Maximum Number of Colinear Points0.043762716103738%3.8Mediumen
Minimum Cost Maximum Flow0.0113774033150037%4.8Mediumen
Minimum Spanning Tree0.0435615426405426%4.0Mediumen
Modular Arithmetic0.002023328159848%2.9Mediumen
Partial Linear Equation Solver0.011452205338419%7.5Harden
Point in Polygon0.003785362142127%5.4Mediumen
Polygon Area0.001186844280041%2.3Easyen
Prime Sieve0.0026612775420233%4.8Mediumen
Rational Arithmetic0.00646714209831%3.4Mediumen
Single source shortest path, negative weights0.0139613673311923%3.9Mediumen
Single source shortest path, non-negative weights0.0233125872812831%2.9Mediumen
Single source shortest path, time table0.013787099223531%3.4Mediumen
String Matching0.0117310879354033%3.7Mediumen
String Multimatching0.104165952153926%5.7Harden
Suffix Sorting0.023074169138833%5.2Mediumen