Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042719760384319%5.4Mediumen
Calculator0.0053730135636%2.9Mediumen
Catalan Numbers0.0054303164138%3.6Mediumen
Chinese Remainder0.0055857160027%4.5Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0053968143636%3.9Mediumen
Closest Pair0.0610997708143419%6.9Harden
Closest Pair (Uniform)0.055708150222027%4.8Mediumen
Convex Hull0.0164414433381126%4.2Mediumen
Eulerian Path0.016174560132929%4.7Mediumen
Line Segment Distance0.00806213487041%4.3Mediumen
Line Segment Intersection0.006894569101822%6.7Harden
Linear Equation Solver0.018923518104830%6.1Harden
Maximum Flow0.0140214045416630%4.4Mediumen
Maximum Number of Colinear Points0.043762673101238%4.4Mediumen
Minimum Cost Maximum Flow0.0113773956148237%5.0Mediumen
Minimum Spanning Tree0.0435615325406427%4.3Mediumen
Modular Arithmetic0.002023346160448%2.9Mediumen
Partial Linear Equation Solver0.011452204738919%7.5Harden
Point in Polygon0.003785360140426%5.6Harden
Polygon Area0.001186860280841%2.5Easyen
Prime Sieve0.0026612901418732%4.8Mediumen
Rational Arithmetic0.00646732212132%3.4Mediumen
Single source shortest path, negative weights0.0139613466307323%4.3Mediumen
Single source shortest path, non-negative weights0.0233125863810031%3.0Mediumen
Single source shortest path, time table0.013787080221331%3.5Mediumen
String Matching0.0117310895356033%3.7Mediumen
String Multimatching0.104165870151026%5.8Harden
Suffix Sorting0.023073963132033%5.5Harden