Roadmap
Learning path to get started in your CP journey.
Basics of Programming
Number Theory
- 1. Euclid's GCD algorithm and Extended Euclid algorithm
- 2. Basic Modular Arithmetic
- 3. Modular Exponentiation
- 4. Modular Inverse
- 5. Prime Factorization of a number
- 6. Sieve of Eratosthenes
- 7. Segmented Sieve
- 8. Euler Totient Function
- 9. Fermat's Little Theorem
- 10. NCR mod p calculation
- 11. Lucas Theorem
- 12. Chinese Remainder Theorem
- 13. Mobius Function
Recursion and Backtracking
Graph
- 1. Graph Representation
- 2. DFS
- 3. BFS
- 4. Bipartite Graph
- 5. Topological Sort
- 6. Kruskal's Algorithm
- 7. Prims's Algorithm
- 8. Dijkstra 's Algorithm
- 9. Bellman Ford's Algorithm
- 10. Floyd Warshall's Algorithm
- 11. Bridge
- 12. Articulation Points
- 13. Strongly Connected Components (SCC)
- 14. Tarjan's Algorithm for SCC
Tree
- 1. Traversal Techniques
- 2. Binary Tree, BST, Balanced Binary Tree
- 3. Binary Lifting
- 4. Bridges, BridgeTree, Cutpoits, SCC, DFS Tree
- 5. Dynamic Programming on tree
- 6. 2K Decomposition of tree (and Lowest Common Ancestor)
- 7. Kruskal Reconstruction Tree (KRT) (IOI Werewolf trick)
- 8. Set Merging (with linear height merging)
- 9. O(N^2) Distribution DP
- 10. 'Re-rooting' tree DP (where you DP twice, once going down and once propagating from top)
- 11. Centroid Decomposition
- 12. Heavy-Light Decomposition
- 13. UFDS on tree (See: CEOI 2017 Streets)
Useful Links
DEVELOPERS & CODERS CLUB NITA
National Institute of Technology, Agartala,
Jirania, Tripura - 799046
SOCIAL
