Problems from KTH CSC Popup 2005

Submissions Users
Name   Total Acc. Ratio Fastest Total Acc. Ratio Difficulty
All Pairs Shortest Path 15704 3014 19% 0.00 1898 1375 72% 5.4
Calculator 2768 1024 37% 0.00 950 794 84% 3.0
Catalan Numbers 3568 1390 39% 0.00 1079 891 83% 3.9
Chinese Remainder 4652 1277 27% 0.00 901 691 77% 4.9
Chinese Remainder Theorem (non-relatively prime moduli) 3309 1234 37% 0.00 816 694 85% 3.9
Closest Pair 5277 975 18% 0.06 667 330 49% 8.1
Closest Pair (Uniform) 5253 1594 30% 0.05 617 431 70% 6.5
Convex Hull 10702 2826 26% 0.01 1824 1310 72% 5.0
Eulerian Path 3844 1137 30% 0.01 528 416 79% 5.8
Linear Equation Solver 2852 874 31% 0.01 377 286 76% 6.4
Line Segment Distance 1868 758 41% 0.00 491 420 86% 4.1
Line Segment Intersection 3497 773 22% 0.00 454 328 72% 6.6
Maximum Flow 9890 2991 30% 0.01 1278 904 71% 5.7
Maximum Number of Colinear Points 2038 784 38% 0.04 381 316 83% 4.9
Minimum Cost Maximum Flow 3095 1098 35% 0.01 456 369 81% 5.1
Minimum Spanning Tree 12335 3291 27% 0.04 1792 1462 82% 4.4
Modular Arithmetic 2519 1254 50% 0.00 830 720 87% 3.2
Partial Linear Equation Solver 1747 337 19% 0.01 218 143 66% 7.6
Point in Polygon 4697 1256 27% 0.00 706 549 78% 5.9
Polygon Area 5850 2380 41% 0.00 1816 1579 87% 2.9
Prime Sieve 11220 3669 33% 0.00 1948 1456 75% 4.5
Rational Arithmetic 5753 1859 32% 0.00 1246 1068 86% 3.5
Single source shortest path, negative weights 10528 2369 23% 0.01 1261 934 74% 4.9
Single source shortest path, non-negative weights 20078 6267 31% 0.02 2961 2470 83% 3.9
Single source shortest path, time table 5596 1774 32% 0.01 995 840 84% 4.0
String Matching 9361 2995 32% 0.01 1812 1384 76% 4.5
String Multimatching 5121 1245 24% 0.10 574 380 66% 7.4
Suffix Sorting 3137 1087 35% 0.02 528 405 77% 5.6