Problems from KTH CSC Popup 2005

Submissions Users
Name   Total Acc. Ratio Fastest Total Acc. Ratio Difficulty
All Pairs Shortest Path 10657 1968 18% 0.00 1288 920 71% 5.5
Calculator 1528 562 37% 0.00 473 399 84% 3.2
Catalan Numbers 2507 1003 40% 0.00 706 581 82% 3.7
Chinese Remainder 3255 851 26% 0.00 561 430 77% 5.5
Chinese Remainder Theorem (non-relatively prime moduli) 2150 782 36% 0.00 503 429 85% 4.0
Closest Pair 3746 687 18% 0.06 428 213 50% 8.0
Closest Pair (Uniform) 3637 1109 30% 0.09 434 313 72% 5.7
Convex Hull 5916 1564 26% 0.01 1078 762 71% 4.7
Eulerian Path 1908 612 32% 0.01 287 224 78% 5.8
Line Segment Distance 1080 434 40% 0.00 283 240 85% 4.2
Line Segment Intersection 1822 428 23% 0.00 231 173 75% 6.6
Linear Equation Solver 1927 597 31% 0.01 234 178 76% 6.5
Maximum Flow 6463 2036 32% 0.01 796 556 70% 6.2
Maximum Number of Colinear Points 1375 535 39% 0.04 262 217 83% 5.0
Minimum Cost Maximum Flow 1837 708 39% 0.02 286 239 84% 5.3
Minimum Spanning Tree 8737 2314 26% 0.05 1240 1027 83% 3.7
Modular Arithmetic 1587 799 50% 0.00 500 441 88% 3.0
Partial Linear Equation Solver 1290 227 18% 0.01 146 96 66% 7.8
Point in Polygon 3258 878 27% 0.00 476 388 82% 5.4
Polygon Area 4128 1679 41% 0.00 1286 1125 87% 2.7
Prime Sieve 7952 2688 34% 0.00 1335 999 75% 4.5
Rational Arithmetic 3981 1335 34% 0.00 913 782 86% 3.4
Single source shortest path, negative weights 7392 1670 23% 0.01 882 638 72% 5.3
Single source shortest path, non-negative weights 14215 4457 31% 0.02 2039 1706 84% 3.6
Single source shortest path, time table 3153 1095 35% 0.01 634 541 85% 3.9
String Matching 6022 1898 32% 0.01 1133 863 76% 4.5
String Multimatching 3336 874 26% 0.10 371 259 70% 6.8
Suffix Sorting 1992 747 38% 0.03 311 245 79% 5.6