Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Authors
Full Solves
Ratio
Difficulty
Languages
All Pairs Shortest Path0.003893096230174%3.0Mediumen
Calculator0.00271419115982%3.2Mediumen
Catalan Numbers0.00621479123283%3.0Mediumen
Chinese Remainder0.001011333106880%3.1Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.001611226104285%2.9Mediumen
Closest Pair0.05572128769454%5.6Harden
Closest Pair (Uniform)0.03312120787372%3.4Mediumen
Convex Hull0.015963332251075%2.6Easyen
Eulerian Path0.0161774259480%4.1Mediumen
Line Segment Distance0.0040483371586%3.1Mediumen
Line Segment Intersection0.0068978357674%5.2Mediumen
Linear Equation Solver0.0189251039778%4.7Mediumen
Maximum Flow0.014022093160777%3.2Mediumen
Maximum Number of Colinear Points0.0337174163786%2.8Mediumen
Minimum Cost Maximum Flow0.01137766254983%4.5Mediumen
Minimum Spanning Tree0.023562777229983%2.6Easyen
Modular Arithmetic0.001881384121087%2.3Easyen
Partial Linear Equation Solver0.01107029718763%6.8Harden
Point in Polygon0.00378102580679%4.2Mediumen
Polygon Area0.001182551226089%1.9Easyen
Prime Sieve0.002362721200674%4.4Mediumen
Rational Arithmetic0.00641613137485%3.0Mediumen
Single source shortest path, negative weights0.002382294184380%2.4Easyen
Single source shortest path, non-negative weights0.012514957417384%2.1Easyen
Single source shortest path, time table0.012941427124988%2.4Easyen
String Matching0.011732795219178%3.0Mediumen
String Multimatching0.1041698371373%4.3Mediumen
Suffix Sorting0.0230788967576%4.5Mediumen