Problems from KTH CSC Popup 2005

Submissions Users
Name   Total Acc. Ratio Fastest Total Acc. Ratio Difficulty
All Pairs Shortest Path 13909 2678 19% 0.00 1688 1211 72% 5.8
Calculator 2359 851 36% 0.00 774 640 83% 3.4
Catalan Numbers 3259 1277 39% 0.00 970 801 83% 3.8
Chinese Remainder 4225 1133 27% 0.00 776 589 76% 5.5
Chinese Remainder Theorem (non-relatively prime moduli) 2947 1086 37% 0.00 711 603 85% 3.7
Closest Pair 4729 842 18% 0.06 584 294 50% 8.0
Closest Pair (Uniform) 4580 1369 30% 0.09 546 383 70% 6.4
Convex Hull 9072 2388 26% 0.01 1558 1130 73% 4.3
Eulerian Path 3344 1022 31% 0.01 476 365 77% 6.2
Linear Equation Solver 2649 817 31% 0.01 340 256 75% 6.4
Line Segment Distance 1524 641 42% 0.00 425 357 84% 4.2
Line Segment Intersection 3132 700 22% 0.00 392 290 74% 6.5
Maximum Flow 9224 2751 30% 0.01 1173 821 70% 5.4
Maximum Number of Colinear Points 1726 641 37% 0.04 333 273 82% 5.1
Minimum Cost Maximum Flow 2749 974 35% 0.02 408 328 80% 5.2
Minimum Spanning Tree 10986 2961 27% 0.05 1592 1300 82% 4.2
Modular Arithmetic 2250 1092 49% 0.00 711 612 86% 3.4
Partial Linear Equation Solver 1657 313 19% 0.01 203 134 66% 7.5
Point in Polygon 4107 1097 27% 0.00 634 490 77% 6.1
Polygon Area 5406 2176 40% 0.00 1661 1442 87% 3.0
Prime Sieve 10338 3401 33% 0.00 1795 1339 75% 4.7
Rational Arithmetic 5279 1736 33% 0.00 1155 991 86% 3.4
Single source shortest path, negative weights 9401 2108 22% 0.01 1129 833 74% 4.9
Single source shortest path, non-negative weights 17770 5518 31% 0.02 2570 2149 84% 3.6
Single source shortest path, time table 4022 1410 35% 0.01 808 698 86% 3.7
String Matching 7936 2563 32% 0.01 1574 1200 76% 4.4
String Multimatching 4310 1069 25% 0.10 504 335 66% 7.2
Suffix Sorting 2666 935 35% 0.03 451 344 76% 5.7