Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042719033372720%5.7Harden
Calculator0.0053649131836%3.1Mediumen
Catalan Numbers0.0054240161438%3.6Mediumen
Chinese Remainder0.001015584151227%4.8Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.002473813138336%3.9Mediumen
Closest Pair0.0610997158129318%7.3Harden
Closest Pair (Uniform)0.055707637210428%5.4Mediumen
Convex Hull0.0164413629359726%4.6Mediumen
Eulerian Path0.016174306124929%5.8Harden
Line Segment Distance0.00871203682641%4.3Mediumen
Line Segment Intersection0.00689440798122%6.5Harden
Linear Equation Solver0.018923449101729%6.3Harden
Maximum Flow0.0140213762408830%4.4Mediumen
Maximum Number of Colinear Points0.04376257996938%4.6Mediumen
Minimum Cost Maximum Flow0.0113773897145437%5.1Mediumen
Minimum Spanning Tree0.0435614986395426%4.4Mediumen
Modular Arithmetic0.002173234154448%3.0Mediumen
Partial Linear Equation Solver0.011452200238619%7.5Harden
Point in Polygon0.003785219135026%5.9Harden
Polygon Area0.001186706271741%2.6Easyen
Prime Sieve0.0026612695412232%4.9Mediumen
Rational Arithmetic0.00646612206931%3.5Mediumen
Single source shortest path, negative weights0.0139613157299223%4.2Mediumen
Single source shortest path, non-negative weights0.0233125342789631%3.1Mediumen
Single source shortest path, time table0.013786959215431%3.8Mediumen
String Matching0.0117710564343733%3.9Mediumen
String Multimatching0.104165598138725%6.9Harden
Suffix Sorting0.023073872128933%5.5Harden