Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003893036224274%3.1Mediumen
Calculator0.00271407115182%3.2Mediumen
Catalan Numbers0.00621459121383%3.1Mediumen
Chinese Remainder0.001011308104580%3.1Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.00161117999684%3.1Mediumen
Closest Pair0.05572127068254%5.7Harden
Closest Pair (Uniform)0.03312118785872%3.4Mediumen
Convex Hull0.015963234241675%2.8Mediumen
Eulerian Path0.0161772457680%4.3Mediumen
Line Segment Distance0.0040479668286%3.2Mediumen
Line Segment Intersection0.0068975755373%5.5Harden
Linear Equation Solver0.0189249638477%4.9Mediumen
Maximum Flow0.014022019153376%3.5Mediumen
Maximum Number of Colinear Points0.0337170760686%2.9Mediumen
Minimum Cost Maximum Flow0.01137763852682%4.6Mediumen
Minimum Spanning Tree0.033562712223382%3.0Mediumen
Modular Arithmetic0.001881352118187%2.4Easyen
Partial Linear Equation Solver0.01107028717962%7.0Harden
Point in Polygon0.00378100678678%4.5Mediumen
Polygon Area0.001182511222188%2.0Easyen
Prime Sieve0.002362699199174%4.2Mediumen
Rational Arithmetic0.00641600136285%3.1Mediumen
Single source shortest path, negative weights0.002382234178280%2.5Easyen
Single source shortest path, non-negative weights0.012514881410184%2.2Easyen
Single source shortest path, time table0.012941404122587%2.6Easyen
String Matching0.011732754215478%3.1Mediumen
String Multimatching0.1041695868872%4.5Mediumen
Suffix Sorting0.0230787466076%4.6Mediumen