Problems from KTH CSC Popup 2005

Submissions Users
Name   Total Acc. Ratio Fastest Total Acc. Ratio Difficulty
All Pairs Shortest Path 14249 2745 19% 0.00 1743 1257 72% 5.6
Calculator 2434 885 36% 0.00 808 671 83% 3.2
Catalan Numbers 3359 1309 39% 0.00 996 821 82% 3.9
Chinese Remainder 4280 1147 27% 0.00 797 600 75% 5.6
Chinese Remainder Theorem (non-relatively prime moduli) 3053 1115 37% 0.00 732 618 84% 3.9
Closest Pair 4814 858 18% 0.06 600 303 50% 8.0
Closest Pair (Uniform) 4871 1440 30% 0.09 574 403 70% 6.4
Convex Hull 9637 2518 26% 0.01 1642 1184 72% 5.0
Eulerian Path 3588 1058 29% 0.01 496 382 77% 6.1
Linear Equation Solver 2662 824 31% 0.01 346 262 76% 6.5
Line Segment Distance 1557 657 42% 0.00 441 370 84% 4.3
Line Segment Intersection 3233 711 22% 0.00 415 300 72% 6.5
Maximum Flow 9343 2774 30% 0.01 1190 831 70% 5.7
Maximum Number of Colinear Points 1762 654 37% 0.04 344 283 82% 5.2
Minimum Cost Maximum Flow 2794 990 35% 0.02 416 335 81% 5.3
Minimum Spanning Tree 11297 3015 27% 0.05 1644 1334 81% 4.8
Modular Arithmetic 2310 1123 49% 0.00 736 634 86% 3.4
Partial Linear Equation Solver 1658 314 19% 0.01 205 135 66% 7.6
Point in Polygon 4153 1106 27% 0.00 644 497 77% 6.2
Polygon Area 5522 2228 40% 0.00 1698 1474 87% 3.1
Prime Sieve 10583 3469 33% 0.00 1838 1366 74% 5.0
Rational Arithmetic 5403 1766 33% 0.00 1184 1014 86% 3.5
Single source shortest path, negative weights 9741 2175 22% 0.01 1172 869 74% 4.8
Single source shortest path, non-negative weights 18355 5676 31% 0.02 2665 2227 84% 3.8
Single source shortest path, time table 4125 1440 35% 0.01 825 713 86% 3.7
String Matching 8239 2645 32% 0.01 1638 1249 76% 4.7
String Multimatching 4396 1095 25% 0.10 512 342 67% 7.2
Suffix Sorting 2703 940 35% 0.03 460 348 76% 5.9