Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042721417422020%4.3Mediumen
Calculator0.0054007142936%3.1Mediumen
Catalan Numbers0.0054860182938%3.2Mediumen
Chinese Remainder0.0056196173228%3.8Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054255155036%3.5Mediumen
Closest Pair0.055729171177919%6.7Harden
Closest Pair (Uniform)0.035708714248128%4.6Mediumen
Convex Hull0.0159615670414826%4.3Mediumen
Eulerian Path0.016174751138729%4.7Mediumen
Line Segment Distance0.00806228492741%4.2Mediumen
Line Segment Intersection0.006894958110922%6.6Harden
Linear Equation Solver0.018923713110430%5.4Mediumen
Maximum Flow0.0140215439454129%4.1Mediumen
Maximum Number of Colinear Points0.043762884113939%3.4Mediumen
Minimum Cost Maximum Flow0.0113774285157337%5.0Mediumen
Minimum Spanning Tree0.0335616447443527%3.7Mediumen
Modular Arithmetic0.001983663175348%2.8Mediumen
Partial Linear Equation Solver0.011070213741619%7.3Harden
Point in Polygon0.003785553148927%5.1Mediumen
Polygon Area0.001187217297041%2.2Easyen
Prime Sieve0.0023613989445932%4.3Mediumen
Rational Arithmetic0.00646984220332%3.4Mediumen
Single source shortest path, negative weights0.0039614607340123%3.6Mediumen
Single source shortest path, non-negative weights0.0133127894881932%2.7Easyen
Single source shortest path, time table0.013787640243232%2.8Mediumen
String Matching0.0117312096387232%3.7Mediumen
String Multimatching0.104166371165126%5.4Mediumen
Suffix Sorting0.023074494147633%5.2Mediumen