CP-Devils
Our Competitive Programming Notes aimed for ACM-ICPC 2020 world finals
This repo contains some implementations from some basic to highly advanced topics of Competitive Programming
To-do:
- GCD Extended for co-efficients
- BFS
- Seg-Tree Range Query Range Update
- Seg-Tree Range Query Point Update
- Seg-Tree Point Query Range Update
- BIT Point Update Range Query
- BIT Range Update Point Query
- BIT Range Update Range Query
- Range Update Range Query
- Sqrt Decomposition
- Min Spanning Tree - Prim's
- Modular Multiplication for large M
- Convex Hull
- Dynamic Convex Hull
- Convex Hull Trick
- Hashing with all 4 types of update
- KMP
- Prefix Function
- Z-Function
- Suffix Array
- Aho Corasick
- Strongly Connected Component
- Biconnected Components, Finding Articulation points and Bridges
- Bellman Ford
- Generalized Suffix Tree
- LCA (Binary Lifting)
- Find loop in a graph
- Dijiktra's
- Heavy Light Decomposition
- Centroid Decomposition
- Max Flow
- Min Cost Max Flow
- Persistant Seg-Tree
- Trie
- Mo's Algo
- Treap
- Fast Fourier Transform
Contributors
- Jatin Nagpal [Github Codechef Codeforces]