Problems from KTH CSC Popup 2005

	Submissions				Users
Name	Total	Acc.	Ratio	Fastest	Total	Acc.	Ratio	Difficulty
All Pairs Shortest Path	11773	2195	19%	0.00	1393	998	72%	5.0
Calculator	1778	664	37%	0.00	568	483	85%	3.1
Catalan Numbers	2802	1100	39%	0.00	784	649	83%	3.6
Chinese Remainder	3669	957	26%	0.00	631	482	76%	5.4
Chinese Remainder Theorem (non-relatively prime moduli)	2373	857	36%	0.00	553	469	85%	3.9
Closest Pair	4206	758	18%	0.06	490	242	49%	8.0
Closest Pair (Uniform)	4177	1253	30%	0.09	480	341	71%	6.1
Convex Hull	6829	1766	26%	0.01	1194	845	71%	4.6
Eulerian Path	2836	880	31%	0.01	399	310	78%	5.8
Linear Equation Solver	2344	702	30%	0.01	291	214	74%	6.7
Line Segment Distance	1298	537	41%	0.00	344	289	84%	4.3
Line Segment Intersection	2502	564	23%	0.00	303	223	74%	6.6
Maximum Flow	8181	2434	30%	0.01	1004	686	68%	6.1
Maximum Number of Colinear Points	1506	565	38%	0.04	282	229	81%	5.2
Minimum Cost Maximum Flow	2254	754	33%	0.02	330	257	78%	5.4
Minimum Spanning Tree	9480	2533	27%	0.05	1326	1089	82%	3.9
Modular Arithmetic	1889	896	47%	0.00	567	491	87%	3.2
Partial Linear Equation Solver	1484	263	18%	0.01	173	111	64%	7.6
Point in Polygon	3485	936	27%	0.00	507	403	79%	5.7
Polygon Area	4310	1751	41%	0.00	1341	1173	87%	2.7
Prime Sieve	8813	2917	33%	0.00	1447	1079	75%	4.9
Rational Arithmetic	4383	1483	34%	0.00	986	844	86%	3.4
Single source shortest path, negative weights	8246	1807	22%	0.01	974	697	72%	5.4
Single source shortest path, non-negative weights	15494	4801	31%	0.02	2168	1810	83%	3.6
Single source shortest path, time table	3450	1186	34%	0.01	679	580	85%	3.8
String Matching	6414	2025	32%	0.01	1233	935	76%	4.9
String Multimatching	3545	916	26%	0.10	413	273	66%	7.0
Suffix Sorting	2228	777	35%	0.03	354	265	75%	5.8