Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.004272850207473%3.9Mediumen
Calculator0.00271386113882%3.1Mediumen
Catalan Numbers0.00621436119583%3.1Mediumen
Chinese Remainder0.001011270101080%3.3Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.00161116097784%3.2Mediumen
Closest Pair0.05572123765553%6.2Harden
Closest Pair (Uniform)0.03312114582072%3.5Mediumen
Convex Hull0.015963062226174%3.3Mediumen
Eulerian Path0.0161772257480%4.4Mediumen
Line Segment Distance0.0040471460885%3.5Mediumen
Line Segment Intersection0.0068973753873%5.9Harden
Linear Equation Solver0.0189249037877%5.1Mediumen
Maximum Flow0.014021945146675%4.1Mediumen
Maximum Number of Colinear Points0.0337168858785%3.1Mediumen
Minimum Cost Maximum Flow0.01137762251082%4.8Mediumen
Minimum Spanning Tree0.033562652218082%3.1Mediumen
Modular Arithmetic0.001881225106087%2.7Easyen
Partial Linear Equation Solver0.01107028217562%7.1Harden
Point in Polygon0.0037898276778%4.6Mediumen
Polygon Area0.001182472218588%2.0Easyen
Prime Sieve0.002362680197674%4.2Mediumen
Rational Arithmetic0.00641588135485%3.1Mediumen
Single source shortest path, negative weights0.003962017157978%3.1Mediumen
Single source shortest path, non-negative weights0.013314739396584%2.5Easyen
Single source shortest path, time table0.013781380120387%2.7Easyen
String Matching0.011732636205878%3.1Mediumen
String Multimatching0.1041692766572%4.2Mediumen
Suffix Sorting0.0230784263676%4.8Mediumen