##Algo
####Data Structures
- Union-find (normal + lazy)
- Fenwick tree (normal + 2D + 3D)
- Sparse table
- SQRT-decomposition
- Interval tree (normal + lazy)
- Treap (cutpaste + insertmin + insertsum + lazy reverse)
####Graph Theory
- BFS (normal + cc)
- DFS (normal + cc + directed cycle + ancestor + bridges + cutpoints + scc + 2SAT)
- SPA (Dijkstra + Dijkstra set + Floyd + Ford-Bellman)
- MST (Prim + Prim set + Kruskal)
- LCA (binary lifting + Tarjan + interval tree)
- Kuhn (max matching + min vertex cover + max independent set)
- Flows (Dinic + pushflow)
####Dynamic Programming
- Dynamics on profile
- Dynamics on subsets
- Memoization
####String Algorithms
- Prefix-function (function + find + different substrings + compress + prefix automata)
- Z-function (function + find + different substrings + compress)
- Hash-function Rabin-Carp (function + find)
- Suffix array (normal + lazy + lcp + different substrings + compare)
- Trie
####Mathematica
- Binary powering (normal + matrix)
- Combinations (binpow + dp)
- GCD (normal + extended)
- Inverse (all + binpow + GCD)
- Factorization (normal + Euler function)
- Eratosphenes sieve
- Submasks
- Grey code
- Chinese remainder theorem
####Geometry
- Point (distance + angle + polar angle)
- Triangle area (signed + area)
- Lines (build + normalize + distance + intersect + parallel + equivalent)
- Intervals (distance + intersect)
- Rays (distance)
- Polygon (area + convex hull)
- Two nearest points
####Numerical Algorithms
- Binary search
- Ternary search
- Simpson integration
- Gauss (normal + rank mod)
####Game Theory
- Sprague-Grundy theory