Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.004272869208873%3.9Mediumen
Calculator0.00271386113882%3.0Mediumen
Catalan Numbers0.00621437119583%3.1Mediumen
Chinese Remainder0.001011272101179%3.3Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.00161116197884%3.2Mediumen
Closest Pair0.05572124466053%6.1Harden
Closest Pair (Uniform)0.03312114682072%3.5Mediumen
Convex Hull0.015963071226974%3.3Mediumen
Eulerian Path0.0161772357479%4.4Mediumen
Line Segment Distance0.0040471761085%3.5Mediumen
Line Segment Intersection0.0068973853873%5.9Harden
Linear Equation Solver0.0189249037877%5.1Mediumen
Maximum Flow0.014021948146875%4.0Mediumen
Maximum Number of Colinear Points0.0337169058985%3.1Mediumen
Minimum Cost Maximum Flow0.01137762251082%4.8Mediumen
Minimum Spanning Tree0.033562652218082%3.1Mediumen
Modular Arithmetic0.001881228106387%2.7Easyen
Partial Linear Equation Solver0.01107028117462%7.1Harden
Point in Polygon0.0037898276778%4.6Mediumen
Polygon Area0.001182473218588%2.0Easyen
Prime Sieve0.002362683197974%4.2Mediumen
Rational Arithmetic0.00641592135685%3.1Mediumen
Single source shortest path, negative weights0.003962034159578%3.1Mediumen
Single source shortest path, non-negative weights0.013314755398084%2.5Easyen
Single source shortest path, time table0.013781381120487%2.6Easyen
String Matching0.011732645206578%3.1Mediumen
String Multimatching0.1041693867472%4.3Mediumen
Suffix Sorting0.0230784764176%4.6Mediumen