How programacioncompetitivaufps/notebook works
Main C++ components
• Data Structures
• Dynamic Programming
• Geometry
• Graphs
• Math
• Modular arithmetic
• Network flows
• Strings
• Utilities
• Values sequences and results
2. For each C++ module, expand the files contained in that module as subcomponents. For example:
── Data Structures:
▪ Centroid Decomposition.cpp
▪ Convex Hull Trick.cpp
▪ Disjoint Set.cpp
▪ Dsu on Tree (Sack).cpp
▪ Fenwick Tree.cpp
▪ Heavy Light Decomposition.cpp
▪ Min queue.cpp
▪ Ordered Set.cpp
▪ Persistent Segment Tree.cpp
▪ Segment Tree (Lazy Propagation).cpp
▪ Segment Tree 2D.cpp
▪ Sparse Table.cpp
▪ Sparse table 2D.cpp
── Dynamic Programming:
▪ Longest Increasing Subsequence.cpp
▪ Max Range Sum.cpp
▪ Min Max Range.cpp
▪ Traveling Salesman Problem.cpp
── Geometry:
▪ Point.cpp
▪ circle.cpp
▪ halfplanes.cpp
▪ line.cpp
▪ polygon.cpp
▪ segment.cpp
── Graphs:
▪ 2-satisfiability.cpp
▪ Articulation Bridges Biconnected.cpp
▪ BFS.cpp
▪ Bellman Ford.cpp
▪ Bipartite Check.cpp
▪ Cycle Detection.cpp
▪ DFS.cpp
▪ Dijkstra.cpp
▪ Flood Fill.cpp
▪ Floyd Warshall.cpp
▪ Kruskal.cpp
▪ Lowest Common Ancestor.cpp
▪ Prim.cpp
▪ Tarjan.cpp
▪ Topological Sort.cpp
▪ Tree Isomorphism.cpp
── Math:
▪ Basis of a Vector Space (mod 2 Field).cpp
▪ Binomial Coefficient.cpp
▪ Diophantine Ecuations.cpp
▪ Divisors.cpp
▪ Euler Totient.cpp
▪ Extended Euclides.cpp
▪ Fast Fourier Transform.cpp
▪ Fraction.cpp
▪ Gauss Jordan.cpp
▪ Greatest Common Divisor.cpp
▪ Lowest Common Multiple.cpp
▪ Miller Rabin.cpp
▪ Mobius.cpp
▪ Pollard Rho.cpp
▪ Prime Factorization.cpp
▪ Sieve of Eratosthenes.cpp
▪ Simplex integer.cpp
▪ Simplex.cpp
▪ Ternary Search.cpp
── Modular arithmetic:
▪ Chinese Remainder Theorem.cpp
▪ Discrete Logarithm.cpp
▪ Fibonacci mod m.cpp
▪ Linear Recurrence.cpp
▪ Matrix Multiplication.cpp
▪ Modular Exponentiation.cpp
▪ Modular Inverse.cpp
▪ Modular Multiplication.cpp
▪ Pisano Period.cpp
▪ Primitive Root.cpp
── Network flows:
▪ Blossom.cpp
▪ Dinic.cpp
▪ Hungarian.cpp
▪ Maximum Bipartite Matching.cpp
▪ MinCost MaxFlow.cpp
▪ Stoer Wagner.cpp
▪ Weighted matching.cpp
── Strings:
▪ Aho Corasick (Trie).cpp
▪ Hashing.cpp
▪ KMP Automaton.cpp
▪ KMP.cpp
▪ Manacher.cpp
▪ Minimum Expression.cpp
▪ Palindromic tree.cpp
▪ Prefix Function.cpp
▪ Suffix Array.cpp
▪ Suffix Automaton.cpp
▪ Z Function.cpp
── Utilities:
▪ Bits Manipulation.cpp
▪ Random Integer.cpp
▪ Split String.cpp
▪ Template.cpp
▪ scanf and printf.cpp
── Values sequences and results:
▪ ASCII Table.tex
▪ Formulas.tex
▪ Sequences.tex
▪ Time Complexities.tex
Relationships and interactions
• Inter-module relationships where algorithms in one module (e.g., Network flows for matching problems) often rely on graph representations (thus linking to the Graphs module).