Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042718889370220%5.4Mediumen
Calculator0.0053588129136%3.2Mediumen
Catalan Numbers0.0054122155438%3.7Mediumen
Chinese Remainder0.001015428145327%4.9Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.002473720133236%4.1Mediumen
Closest Pair0.0610997061126918%7.4Harden
Closest Pair (Uniform)0.055707596208627%5.3Mediumen
Convex Hull0.0164413516356126%4.7Mediumen
Eulerian Path0.016174283123729%5.8Harden
Line Segment Distance0.00871199980940%4.4Mediumen
Line Segment Intersection0.001366431394622%6.4Harden
Linear Equation Solver0.018923429101129%6.3Harden
Maximum Flow0.0140213299400530%4.5Mediumen
Maximum Number of Colinear Points0.04376244691637%4.7Mediumen
Minimum Cost Maximum Flow0.0113773865144037%5.1Mediumen
Minimum Spanning Tree0.0435614705385726%4.3Mediumen
Modular Arithmetic0.002573121147647%3.2Mediumen
Partial Linear Equation Solver0.011452199938619%7.5Harden
Point in Polygon0.003785199133526%5.9Harden
Polygon Area0.001186665269840%2.7Easyen
Prime Sieve0.0026612509403532%4.9Mediumen
Rational Arithmetic0.00646521202531%3.5Mediumen
Single source shortest path, negative weights0.0139613023296323%4.2Mediumen
Single source shortest path, non-negative weights0.0233125141783231%2.9Mediumen
Single source shortest path, time table0.013786898212531%3.7Mediumen
String Matching0.0117710328334632%4.0Mediumen
String Multimatching0.104165378131124%7.1Harden
Suffix Sorting0.023073702121133%5.6Harden