Problems from KTH CSC Popup 2005

	Submissions				Users
Name	Total	Acc.	Ratio	Fastest	Total	Acc.	Ratio	Difficulty
All Pairs Shortest Path	8500	1510	18%	0.00	1044	734	70%	6.0
Calculator	1222	452	37%	0.00	400	331	83%	3.4
Catalan Numbers	2092	795	38%	0.03	603	496	82%	3.6
Chinese Remainder	2433	610	25%	0.00	442	335	76%	5.4
Chinese Remainder Theorem (non-relatively prime moduli)	1737	592	34%	0.00	393	338	86%	3.9
Closest Pair	3416	611	18%	0.06	395	197	50%	7.9
Closest Pair (Uniform)	2757	803	29%	0.09	366	260	71%	5.7
Convex Hull	4718	1214	26%	0.01	897	621	69%	5.1
Eulerian Path	1793	586	33%	0.01	270	212	79%	5.8
Linear Equation Solver	1601	481	30%	0.01	199	151	76%	6.6
Line Segment Distance	936	377	40%	0.00	245	210	86%	4.1
Line Segment Intersection	1609	378	23%	0.00	204	155	76%	6.6
Maximum Flow	5439	1832	34%	0.01	699	498	71%	6.2
Maximum Number of Colinear Points	1037	394	38%	0.04	205	173	84%	5.0
Minimum Cost Maximum Flow	1770	658	37%	0.02	271	224	83%	5.5
Minimum Spanning Tree	7267	1838	25%	0.05	1038	838	81%	4.1
Modular Arithmetic	1071	577	54%	0.00	356	323	91%	2.8
Partial Linear Equation Solver	905	180	20%	0.01	123	78	63%	8.2
Point in Polygon	2203	591	27%	0.00	371	301	81%	5.5
Polygon Area	3480	1346	39%	0.00	1092	943	86%	2.9
Prime Sieve	6534	2153	33%	0.00	1151	838	73%	4.8
Rational Arithmetic	3235	1023	32%	0.00	755	638	85%	3.3
Single source shortest path, negative weights	5720	1255	22%	0.01	697	507	73%	5.0
Single source shortest path, non-negative weights	11143	3430	31%	0.02	1704	1407	83%	3.5
Single source shortest path, time table	2419	788	33%	0.01	487	405	83%	4.0
String Matching	4794	1427	30%	0.01	901	671	74%	5.4
String Multimatching	1911	583	31%	0.18	248	173	70%	6.8
Suffix Sorting	1452	592	41%	0.03	238	191	80%	5.8