Problems from KTH CSC Popup 2005

Submissions Users
Name   Total Acc. Ratio Fastest Total Acc. Ratio Difficulty
All Pairs Shortest Path 12843 2420 19% 0.00 1528 1101 72% 5.3
Calculator 1973 743 38% 0.00 651 551 85% 3.1
Catalan Numbers 3054 1198 39% 0.00 882 731 83% 3.6
Chinese Remainder 3833 1008 26% 0.00 691 525 76% 5.3
Chinese Remainder Theorem (non-relatively prime moduli) 2539 924 36% 0.00 608 517 85% 3.7
Closest Pair 4350 787 18% 0.06 521 261 50% 7.8
Closest Pair (Uniform) 4348 1297 30% 0.09 511 358 70% 6.4
Convex Hull 7944 2049 26% 0.01 1356 972 72% 4.2
Eulerian Path 3216 988 31% 0.01 446 346 78% 5.8
Linear Equation Solver 2534 762 30% 0.01 315 234 74% 6.4
Line Segment Distance 1426 589 41% 0.00 388 326 84% 4.1
Line Segment Intersection 2931 645 22% 0.00 355 263 74% 6.5
Maximum Flow 8695 2593 30% 0.01 1085 748 69% 5.8
Maximum Number of Colinear Points 1582 599 38% 0.04 308 250 81% 5.2
Minimum Cost Maximum Flow 2534 866 34% 0.02 361 283 78% 5.4
Minimum Spanning Tree 10435 2764 26% 0.05 1477 1206 82% 3.9
Modular Arithmetic 2015 968 48% 0.00 623 538 86% 3.1
Partial Linear Equation Solver 1586 281 18% 0.01 188 122 65% 7.5
Point in Polygon 3668 999 27% 0.00 556 441 79% 5.5
Polygon Area 4758 1905 40% 0.00 1479 1289 87% 2.9
Prime Sieve 9545 3149 33% 0.00 1576 1175 75% 4.8
Rational Arithmetic 4913 1610 33% 0.00 1080 923 85% 3.3
Single source shortest path, negative weights 8849 1973 22% 0.01 1049 763 73% 5.1
Single source shortest path, non-negative weights 16436 5129 31% 0.02 2350 1965 84% 3.6
Single source shortest path, time table 3857 1338 35% 0.01 762 658 86% 3.5
String Matching 7043 2187 31% 0.01 1356 1021 75% 4.9
String Multimatching 3891 979 25% 0.10 448 295 66% 7.0
Suffix Sorting 2417 828 34% 0.03 400 297 74% 6.0