Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042722038434720%3.8Mediumen
Calculator0.0054215149535%3.1Mediumen
Catalan Numbers0.0054949186538%3.1Mediumen
Chinese Remainder0.0056378182229%3.4Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054480163336%3.3Mediumen
Closest Pair0.055729872187919%6.3Harden
Closest Pair (Uniform)0.035708961257429%4.3Mediumen
Convex Hull0.0159616538441527%3.5Mediumen
Eulerian Path0.016174927143729%4.4Mediumen
Line Segment Distance0.004042584105241%3.5Mediumen
Line Segment Intersection0.006895519123522%5.9Harden
Linear Equation Solver0.018923751111830%5.1Mediumen
Maximum Flow0.0140215750463329%4.0Mediumen
Maximum Number of Colinear Points0.033713146126340%3.1Mediumen
Minimum Cost Maximum Flow0.0113774381160037%4.6Mediumen
Minimum Spanning Tree0.0335616896460027%3.1Mediumen
Modular Arithmetic0.001883908186048%2.7Easyen
Partial Linear Equation Solver0.011070218542920%7.1Harden
Point in Polygon0.003785817156827%4.7Mediumen
Polygon Area0.001187499312142%2.0Easyen
Prime Sieve0.0023614340455632%4.2Mediumen
Rational Arithmetic0.00647390231731%3.1Mediumen
Single source shortest path, negative weights0.0039615184361224%3.1Mediumen
Single source shortest path, non-negative weights0.0133129030915732%2.5Easyen
Single source shortest path, time table0.013787762249432%2.7Easyen
String Matching0.0117312480402632%3.1Mediumen
String Multimatching0.104166801183727%4.4Mediumen
Suffix Sorting0.023074565150733%4.8Mediumen