Training MIST

	A	B	C	D	E	H	I	J	L	M	N	O	Q	R	S	U	V	W	X	Y	Z	AA	AB	AC	AD	AE	AF	AG
1		Name of the topic	Please put 0 if you don't know the algo, 1 if you know, 2 if you know and solved problems
2			Takik Hasan	Rafin Neaz	Wazed Rifat	Mohim	Tamim	Avash	Wasif	Rakib	Emon Reza	Riasat	Raiyan Abrar	Emon	Faisal	Saimon	Shad Reza	Abed	Nazia
3		Expertise of a Contestant	190	171	166	38	124	100	94	88	29	54	82	19	71	18	12	53	43	0	0	0	0	0	0	0	0	0

4	STL
5		string	2	2	2	2	2	2	2	2	2	2	2	2	2	2	2	2
6		vector	2	2	2	2	2	2	2	2	1	2	2	2	2	0	2	2	2
7		pair	2	2	2	2	2	2	2	2	0	2	2	2	2	0	1	2	2
8		stack	2	2	2	2	2	2	2	2	2	1	2	0	2	0	1	2	2
9		queue	2	2	2	2	2	2	2	2	2	2	2	0	2	0	1	2	2
10		sort	2	2	2	2	2	2	2	2	1	2	2	2	2	1	1	2	2
11		priority_queue	2	2	2	2	2	2	2	2	1	1	2	0	2	0	1	1	1
12		reverse	2	2	2	2	2	1	2	2	0	2	2	2	2	0	0	0
13		next_permutation	2	2	2	0	2	2	2	2	0	0	2	2	2	0	0	0	0
14		set	2	2	2	2	2	2	2	2	0	1	2	0	2	0	0	2	2
15		map	2	2	2	2	2	2	2	2	0	2	2	0	2	0	0	2	2
16		unordered map	2	2	2	0	2	2	2	2	0	0	2	0	1	0	0	0	2
17		iterator	2	2	2	2	2	2	2	2	0	2	2	2	1	0	1	2
18		pbds	2	2	2	0	0	0	0	2	0	0	0	0		0	0	0
19	Number Theory/Math													0
20		Prime Generation, Sieve and How to Optimize	2	1	2	2	2	2	2	2	2	2	2	0	2	2	2	2
21		Bitwise Sieve	2	1	1		0	0	0	0	0	0	0	0	2	1	0	0
22		Modular Arithmatic ( + - *)	2	2	2		2	2	2	2	0	0	2	0	2	2		0
23		Modular Inverse (/)	2	2	2		2	1	2	2	0	0	0	0	2	0		0
24		Big Mod ( a^b % p)	2	2	2		2	1	2	2	0	0	1	0	2	1		0
25		Extended Euclid	2	1	1		0	0	0		0	0	0	0		0		0
26		Euler Phi	2	1	1		2	1	2	2	0	0	2	0		0		1
27		Inverse phi	0	1	0		1	0	0		0	0	1	0	1	0		0
28		Prime Factorization	2	2	2		2	2	2	2	2	1	2	0	2	2		2
29		Number of Divisor	2	2	2		2	2	2	2	1	2	2	1	2	1		2
30		Sum of Divisor	2	2	2		2	2	2	2	1	2	2	1	1	1		2
31		Factorizing n!	2	1	1		2	2	0		0	2	0	0		0		0
32		Shanks Algorithm	0	0	0		0	0	0		0	0	0	0		0		0
33		Probability Theory (Topcoder)	0	0	0		0	0	0		0	0	0	0		0		0
34		Dilworth's theorem	0	0	0		0	0	0		0	0	0	0		0		0
35		Chinese Reminder Theorem	2	0	1		0	0	0		0	0	0	0	1	0		0
36		Gaussian Elimination	0	0	1		1	1	0		0	0	0	0		0		0
37		Burnside Lemma	0	0	1		0	0	0		0	0	0	0		0		0
38		Finding Real roots of an n degree Equation	0	0	1		0	0	0		0	0	0	0		0		0
39		Given sum of divisors find possible n	0	0	1		0	0	0		0	0	0	0		0		0
40		Miller Rabin primality test	2	0	0		0	0	0		0		0	0		0		0
41		Pollard's rho algorithm	2	0	0		0	0	0		0	0	0	0		0		0
42		Taking modulo of Power (a^(b%MOD))%MOD	2	2	2		0	0	0		0	0	0	0	2	0		0
43		Lukas Theorem	0	0	0		0	0	0		0	0	0	0		0		0
44		Inclusion Exclusion	2	1	0		1	0	0		0	0	0	0	1	0		0
45		Mobius	0	1	0		0	0	0		0	0	0	0		0		0
46		Floyds Cycle Finding Algorithm	1	1	1		0	2	0		0	0	1	0		0		0
47		Gambler's Ruin	0	0	0		0	0	0		0	0	0	0		0		0
48	Combinatorics
49		Stirling Number 1	0	1	0	0	0	0	0		0	0	0	0		0		0
50		Stirling Number 2	0	1	0		0	0	0		0	0	0	0		0		0
51		Catalan Number	0	1	0		0	0	0		1	0	0	0	1	0		0
52		Derrangement	0	1	1		0	0	0		0	0	0	0	1	0		0
53	Graph
54		Graph Representations (Adjacency Matrix)	2	2	2	2	2	2	2	2	2	2	2	2	2	0		2	2
55		Graph Representations (Adjacency List using vector)	2	2	2	2	2	2	2	2	1	2	2	0	2	0		1	2
56		Breadth First Search BFS	2	2	2	2	2	2	2	2	1	2	2	0	1	0		2	2
57		Bicoloring	2	2	2	1	2	1	2	2	1	1	1	0	1	0		1	1
58		Depth First Search DFS	2	2	2	2	2	2	2	2	1	2	2	0	1	0		1	2
59		Topological Sorting	2	2	2	2	2	2	2		0	0	1	0		0		0
60		Articulation Point	2	2	2	0	0	1	0		0	0	0	0		0		0
61		Bridge	2	2	2	0	1	1	0		0	0	0	0		0		0
62		Strongly Connected Components SCC	2	2	2	0	1	1	0		0	0	0	0		0		0
63		Dijkstra and variations	2	2	2	0	2	1	2	2	0	1	2	0		0		0
64		Bellman Ford and variations	2	2	2	0	1	1	2		0	1	0	0		0		0
65		Floyd Warshall and variations	2	2	2	0	1	1	0		0	0	0	0		0		0
66		Kth Shortest Path	1	1	0	0	2	0	0		0	0	0	0		0		0
67		Minimum Spanning Tree ( Prims)	2	2	2	0	2	2	2		1	0	1	0		0		0	1
68		Minimum Spanning Tree ( Kruskal)	2	2	2	0	2	2	2	2	1	0	1	0		0		0	1
69		Minimum Spanning Tree ( For Directed Graphs )	0	0	0	0	0				0	0	1	0		0		0	1
70		Euler Path (Construction and optimization)	2	1	1	0	1	1			0	0	2	0		0		0
71		Maximum Flow ( Ford Fulkerson )	0	1	1	0	1	1			0	0	0	0		0		0	1
72		Maximum Flow ( Dinic )	2	1	2	0	0	0			0	0	0	0		0		0
73		Maximum Bipartite Matching and Variations	2	1	2	0	0	0			0	0	0	0		0		0
74		Hopkroft Karp (BPM)	1	1	0	0	0	0			0	0	0	0		0		0
75		Maximum Independent Set	2	2	2	0	0	0			0	1	0	0		0		0
76		Minimum Cost Maximum Flow	2	2	2	0	0	0			0	0	0	0		0		0
77		Vertex Cover	2	2	1	0	0	0			0	0	0	0		0		0
78		Edge Cover	0	2	1		0	0			0	0	0	0		0		0
79		Largest Clique	2	1	0		0	0			0	0	0	0		0		0
80		Weighted Bipartite Matching (Hungarian)	2	1	2		0	0			0	0	0	0		0		0
81		IDA* Search Problem, 15 Puzzle	0	0	2		0	0			0	0	0	0		0		0
82		Group Theory	0	2	0		0	0			0	0	0	0		0		0
83		Hamiltonian Cycle	0	0	0		0	0			0	0	1	0		0		0
84		Min Weight Cycles in Graph	0	0	2		0	0			0	0	0	0		0		0
85		Graph Coloring (CSP - Constraint Satisfaction Problem)	0	0	1		1	0			0	0	1	0		0		0
86		Stable Marriage Problem	1	2	2		0	0			0	0	0	0		0		0
87		Stoer Wagner ( Finding the minimum cut of a graph )	0	0	1		0	0			0	0	0	0		0		0
88		Planar Graph Detection	0	0	0		0	0			0	0	0	0		0		0
89		Havel-Hakimi Algorithm (Construct graph given degree of nodes)	0	0	0		0	0			0	0	0	0		0		0
90		Erdos & Gallai Theorem	0	0	0		0	0			0	0	0	0		0		0
91		Biconnected Components	2	2	0		0	0			0	0	0	0		0		0
92		2-Sat	0	0	0		0	0			0	0	0	0		0		0
93		Block Cut Tree	2	0	0		0	0			0	0	0	0		0		0
94		Dominator Tree	0	0	0		0	0			0	0	0	0		0		0
95		Kirchoff's Theorem	0	0	0		0	0			0	0	0	0		0		0
96		Dilworth's Theorem/ Partially Ordered Set/ Maximum Antichain	0	0	0		0	0			0	0	0	0		0		0
97		Flow satisfying lower bound	0	0	0		0	0			0	0	0	0		0		0
98		Circulation MaxFlow + Mincost Circulation Flow	0	0	0		0	0			0	0	0	0		0		0
99	Greedy
100		Task Scheduling	0	0	0		2	1			0	0	0	0	2	0		0