Problems from KTH CSC Popup 2005

Name
Fastest
Shortest
Total
Acc.
Ratio
Difficulty
Languages
All Pairs Shortest Path0.0042720285397720%4.7Mediumen
Calculator0.0053807138136%2.9Mediumen
Catalan Numbers0.0054452163637%3.3Mediumen
Chinese Remainder0.0055865158127%4.2Mediumen
Chinese Remainder Theorem (non-relatively prime moduli)0.0054081145536%3.6Mediumen
Closest Pair0.068918364158319%6.6Harden
Closest Pair (Uniform)0.055708466236228%4.7Mediumen
Convex Hull0.0159614931395426%4.0Mediumen
Eulerian Path0.016174636135829%4.6Mediumen
Line Segment Distance0.00806219990041%4.2Mediumen
Line Segment Intersection0.006894661104222%6.7Harden
Linear Equation Solver0.018923528105630%5.9Harden
Maximum Flow0.0140214477414529%4.1Mediumen
Maximum Number of Colinear Points0.043762753105838%3.8Mediumen
Minimum Cost Maximum Flow0.0113774068151737%4.7Mediumen
Minimum Spanning Tree0.0435615774416126%3.7Mediumen
Modular Arithmetic0.002023357161548%2.9Mediumen
Partial Linear Equation Solver0.011452205938719%7.4Harden
Point in Polygon0.003785393143927%5.2Mediumen
Polygon Area0.001186882282141%2.4Easyen
Prime Sieve0.0026612988424733%4.6Mediumen
Rational Arithmetic0.00646723210431%3.4Mediumen
Single source shortest path, negative weights0.0139613961318823%3.8Mediumen
Single source shortest path, non-negative weights0.0233126592834731%3.1Mediumen
Single source shortest path, time table0.013787363233932%3.2Mediumen
String Matching0.0117311464366632%3.8Mediumen
String Multimatching0.104166020154826%5.9Harden
Suffix Sorting0.023074237140133%5.7Harden