├── .github └── workflows │ ├── check-tracker.yml │ ├── release-new-version.yml │ └── test-compile.yml ├── .gitignore ├── LICENSE ├── README.md ├── content.typ ├── content ├── algorithms │ ├── mo-rollback.cpp │ ├── mo-update.cpp │ ├── mo.cpp │ └── tortoise-hare.cpp ├── combinatorial │ ├── simulated-annealing.cpp │ └── weighted-matroid-intersection.cpp ├── data-structures │ ├── bit-2d.cpp │ ├── bit-vector.cpp │ ├── bit.cpp │ ├── disjoint-sparse-table.cpp │ ├── dynamic-segment-tree.cpp │ ├── extended-segment-tree.cpp │ ├── implicit-treap.cpp │ ├── iterative-segment-tree-lazy.cpp │ ├── kd-tree.cpp │ ├── lct.cpp │ ├── line-container.cpp │ ├── merge-sort-tree.cpp │ ├── min-deque.cpp │ ├── min-queue.cpp │ ├── min-stack.cpp │ ├── ordered-set.cpp │ ├── persistent-segment-tree.cpp │ ├── query-tree.cpp │ ├── range-query-constant.cpp │ ├── segment-tree-lazy.cpp │ ├── segment-tree-with-walk.cpp │ ├── segment-tree.cpp │ ├── sparse-table.cpp │ ├── sqrt-decomposition.cpp │ ├── succinct-indexable-dictionary.cpp │ ├── treap.cpp │ ├── union-find-rollback.cpp │ ├── union-find.cpp │ └── wavelet-tree.cpp ├── dynamic-programming │ ├── convex-hull-trick.cpp │ ├── d&c.cpp │ ├── egg-drop.cpp │ ├── knuth.cpp │ ├── li-chao-segment.cpp │ ├── li-chao-tree.cpp │ ├── line-container.cpp │ └── lis.cpp ├── general │ ├── hash.typ │ ├── template.cpp │ └── troubleshoot.typ ├── geometry │ ├── convex-hull.cpp │ ├── halfplane-intersection.cpp │ ├── halfplane.cpp │ ├── lattice-point.cpp │ ├── nearest-2-points.cpp │ ├── order-by-angle.cpp │ ├── order-by-slope.cpp │ ├── point-2d.cpp │ ├── point-inside-polygon.cpp │ ├── polygon-area.cpp │ └── segment.cpp ├── graphs │ ├── 3-cycle.cpp │ ├── 4-cycle.cpp │ ├── ahld.cpp │ ├── articulation-points.cpp │ ├── bellman-ford.cpp │ ├── bfs.cpp │ ├── bridges.cpp │ ├── centroid-decomposition.cpp │ ├── chromatic-number.cpp │ ├── dfs.cpp │ ├── dijkstra.cpp │ ├── dinic.cpp │ ├── dominator-tree.cpp │ ├── eppstein.cpp │ ├── euler-directed-graph.cpp │ ├── floyd-warshall.cpp │ ├── hld.cpp │ ├── hopcroft-karp.cpp │ ├── hungarian.cpp │ ├── kosaraju.cpp │ ├── kruskal.cpp │ ├── lca-rmq.cpp │ ├── lca.cpp │ ├── mfed.cpp │ └── min-cost-flow.cpp ├── maths │ ├── binary-pow-128-bits.cpp │ ├── binary-pow-mulmod.cpp │ ├── binary-pow.cpp │ ├── counting-divisors.cpp │ ├── crt.cpp │ ├── discrete-log.cpp │ ├── divisors.cpp │ ├── erathostenes-sieve.cpp │ ├── euler-phi-sieve.cpp │ ├── euler-phi.cpp │ ├── extended-gcd.cpp │ ├── factorial.cpp │ ├── fast-ntt.cpp │ ├── fast-prime-factorization.cpp │ ├── fft.cpp │ ├── fraction.cpp │ ├── fwht.cpp │ ├── gauss.cpp │ ├── lagrange-point.cpp │ ├── matrix.cpp │ ├── miller-rabin.cpp │ ├── mobius-sieve.cpp │ ├── montgomery.cpp │ ├── mulmod.cpp │ ├── non-deterministic-miller-rabin.cpp │ ├── ntt.cpp │ ├── pollard-rho.cpp │ ├── poly-shift.cpp │ ├── prime-factors.cpp │ ├── sieveking-kung.cpp │ ├── simplex.cpp │ ├── tetration.cpp │ └── xor-basis.cpp └── strings │ ├── aho-corasick.cpp │ ├── k-rolling-hashing.cpp │ ├── kmp.cpp │ ├── manacher.cpp │ ├── min-rotation.cpp │ ├── rolling-hashing.cpp │ ├── suffix-array.cpp │ ├── suffix-automaton.cpp │ ├── trie.cpp │ └── z.cpp ├── img └── utfsm_cp.png ├── lib ├── hash.typ └── hash.wasm ├── main.typ ├── scripts └── check-tracker.py └── tracker.yaml /.github/workflows/check-tracker.yml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/.github/workflows/check-tracker.yml -------------------------------------------------------------------------------- /.github/workflows/release-new-version.yml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/.github/workflows/release-new-version.yml -------------------------------------------------------------------------------- /.github/workflows/test-compile.yml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/.github/workflows/test-compile.yml -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | main.pdf -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/LICENSE -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/README.md -------------------------------------------------------------------------------- /content.typ: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content.typ -------------------------------------------------------------------------------- /content/algorithms/mo-rollback.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/algorithms/mo-rollback.cpp -------------------------------------------------------------------------------- /content/algorithms/mo-update.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/algorithms/mo-update.cpp -------------------------------------------------------------------------------- /content/algorithms/mo.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/algorithms/mo.cpp -------------------------------------------------------------------------------- /content/algorithms/tortoise-hare.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/algorithms/tortoise-hare.cpp -------------------------------------------------------------------------------- /content/combinatorial/simulated-annealing.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/combinatorial/simulated-annealing.cpp -------------------------------------------------------------------------------- /content/combinatorial/weighted-matroid-intersection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/combinatorial/weighted-matroid-intersection.cpp -------------------------------------------------------------------------------- /content/data-structures/bit-2d.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/bit-2d.cpp -------------------------------------------------------------------------------- /content/data-structures/bit-vector.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/bit-vector.cpp -------------------------------------------------------------------------------- /content/data-structures/bit.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/bit.cpp -------------------------------------------------------------------------------- /content/data-structures/disjoint-sparse-table.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/disjoint-sparse-table.cpp -------------------------------------------------------------------------------- /content/data-structures/dynamic-segment-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/dynamic-segment-tree.cpp -------------------------------------------------------------------------------- /content/data-structures/extended-segment-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/extended-segment-tree.cpp -------------------------------------------------------------------------------- /content/data-structures/implicit-treap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/implicit-treap.cpp -------------------------------------------------------------------------------- /content/data-structures/iterative-segment-tree-lazy.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/iterative-segment-tree-lazy.cpp -------------------------------------------------------------------------------- /content/data-structures/kd-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/kd-tree.cpp -------------------------------------------------------------------------------- /content/data-structures/lct.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/lct.cpp -------------------------------------------------------------------------------- /content/data-structures/line-container.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/line-container.cpp -------------------------------------------------------------------------------- /content/data-structures/merge-sort-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/merge-sort-tree.cpp -------------------------------------------------------------------------------- /content/data-structures/min-deque.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/min-deque.cpp -------------------------------------------------------------------------------- /content/data-structures/min-queue.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/min-queue.cpp -------------------------------------------------------------------------------- /content/data-structures/min-stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/min-stack.cpp -------------------------------------------------------------------------------- /content/data-structures/ordered-set.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/ordered-set.cpp -------------------------------------------------------------------------------- /content/data-structures/persistent-segment-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/persistent-segment-tree.cpp -------------------------------------------------------------------------------- /content/data-structures/query-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/query-tree.cpp -------------------------------------------------------------------------------- /content/data-structures/range-query-constant.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/range-query-constant.cpp -------------------------------------------------------------------------------- /content/data-structures/segment-tree-lazy.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/segment-tree-lazy.cpp -------------------------------------------------------------------------------- /content/data-structures/segment-tree-with-walk.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/segment-tree-with-walk.cpp -------------------------------------------------------------------------------- /content/data-structures/segment-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/segment-tree.cpp -------------------------------------------------------------------------------- /content/data-structures/sparse-table.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/sparse-table.cpp -------------------------------------------------------------------------------- /content/data-structures/sqrt-decomposition.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/sqrt-decomposition.cpp -------------------------------------------------------------------------------- /content/data-structures/succinct-indexable-dictionary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/succinct-indexable-dictionary.cpp -------------------------------------------------------------------------------- /content/data-structures/treap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/treap.cpp -------------------------------------------------------------------------------- /content/data-structures/union-find-rollback.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/union-find-rollback.cpp -------------------------------------------------------------------------------- /content/data-structures/union-find.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/union-find.cpp -------------------------------------------------------------------------------- /content/data-structures/wavelet-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/data-structures/wavelet-tree.cpp -------------------------------------------------------------------------------- /content/dynamic-programming/convex-hull-trick.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/dynamic-programming/convex-hull-trick.cpp -------------------------------------------------------------------------------- /content/dynamic-programming/d&c.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/dynamic-programming/d&c.cpp -------------------------------------------------------------------------------- /content/dynamic-programming/egg-drop.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/dynamic-programming/egg-drop.cpp -------------------------------------------------------------------------------- /content/dynamic-programming/knuth.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/dynamic-programming/knuth.cpp -------------------------------------------------------------------------------- /content/dynamic-programming/li-chao-segment.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/dynamic-programming/li-chao-segment.cpp -------------------------------------------------------------------------------- /content/dynamic-programming/li-chao-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/dynamic-programming/li-chao-tree.cpp -------------------------------------------------------------------------------- /content/dynamic-programming/line-container.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/dynamic-programming/line-container.cpp -------------------------------------------------------------------------------- /content/dynamic-programming/lis.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/dynamic-programming/lis.cpp -------------------------------------------------------------------------------- /content/general/hash.typ: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/general/hash.typ -------------------------------------------------------------------------------- /content/general/template.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/general/template.cpp -------------------------------------------------------------------------------- /content/general/troubleshoot.typ: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/general/troubleshoot.typ -------------------------------------------------------------------------------- /content/geometry/convex-hull.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/convex-hull.cpp -------------------------------------------------------------------------------- /content/geometry/halfplane-intersection.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/halfplane-intersection.cpp -------------------------------------------------------------------------------- /content/geometry/halfplane.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/halfplane.cpp -------------------------------------------------------------------------------- /content/geometry/lattice-point.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/lattice-point.cpp -------------------------------------------------------------------------------- /content/geometry/nearest-2-points.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/nearest-2-points.cpp -------------------------------------------------------------------------------- /content/geometry/order-by-angle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/order-by-angle.cpp -------------------------------------------------------------------------------- /content/geometry/order-by-slope.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/order-by-slope.cpp -------------------------------------------------------------------------------- /content/geometry/point-2d.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/point-2d.cpp -------------------------------------------------------------------------------- /content/geometry/point-inside-polygon.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/point-inside-polygon.cpp -------------------------------------------------------------------------------- /content/geometry/polygon-area.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/polygon-area.cpp -------------------------------------------------------------------------------- /content/geometry/segment.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/geometry/segment.cpp -------------------------------------------------------------------------------- /content/graphs/3-cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/3-cycle.cpp -------------------------------------------------------------------------------- /content/graphs/4-cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/4-cycle.cpp -------------------------------------------------------------------------------- /content/graphs/ahld.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/ahld.cpp -------------------------------------------------------------------------------- /content/graphs/articulation-points.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/articulation-points.cpp -------------------------------------------------------------------------------- /content/graphs/bellman-ford.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/bellman-ford.cpp -------------------------------------------------------------------------------- /content/graphs/bfs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/bfs.cpp -------------------------------------------------------------------------------- /content/graphs/bridges.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/bridges.cpp -------------------------------------------------------------------------------- /content/graphs/centroid-decomposition.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/centroid-decomposition.cpp -------------------------------------------------------------------------------- /content/graphs/chromatic-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/chromatic-number.cpp -------------------------------------------------------------------------------- /content/graphs/dfs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/dfs.cpp -------------------------------------------------------------------------------- /content/graphs/dijkstra.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/dijkstra.cpp -------------------------------------------------------------------------------- /content/graphs/dinic.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/dinic.cpp -------------------------------------------------------------------------------- /content/graphs/dominator-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/dominator-tree.cpp -------------------------------------------------------------------------------- /content/graphs/eppstein.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/eppstein.cpp -------------------------------------------------------------------------------- /content/graphs/euler-directed-graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/euler-directed-graph.cpp -------------------------------------------------------------------------------- /content/graphs/floyd-warshall.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/floyd-warshall.cpp -------------------------------------------------------------------------------- /content/graphs/hld.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/hld.cpp -------------------------------------------------------------------------------- /content/graphs/hopcroft-karp.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/hopcroft-karp.cpp -------------------------------------------------------------------------------- /content/graphs/hungarian.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/hungarian.cpp -------------------------------------------------------------------------------- /content/graphs/kosaraju.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/kosaraju.cpp -------------------------------------------------------------------------------- /content/graphs/kruskal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/kruskal.cpp -------------------------------------------------------------------------------- /content/graphs/lca-rmq.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/lca-rmq.cpp -------------------------------------------------------------------------------- /content/graphs/lca.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/lca.cpp -------------------------------------------------------------------------------- /content/graphs/mfed.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/mfed.cpp -------------------------------------------------------------------------------- /content/graphs/min-cost-flow.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/graphs/min-cost-flow.cpp -------------------------------------------------------------------------------- /content/maths/binary-pow-128-bits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/binary-pow-128-bits.cpp -------------------------------------------------------------------------------- /content/maths/binary-pow-mulmod.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/binary-pow-mulmod.cpp -------------------------------------------------------------------------------- /content/maths/binary-pow.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/binary-pow.cpp -------------------------------------------------------------------------------- /content/maths/counting-divisors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/counting-divisors.cpp -------------------------------------------------------------------------------- /content/maths/crt.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/crt.cpp -------------------------------------------------------------------------------- /content/maths/discrete-log.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/discrete-log.cpp -------------------------------------------------------------------------------- /content/maths/divisors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/divisors.cpp -------------------------------------------------------------------------------- /content/maths/erathostenes-sieve.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/erathostenes-sieve.cpp -------------------------------------------------------------------------------- /content/maths/euler-phi-sieve.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/euler-phi-sieve.cpp -------------------------------------------------------------------------------- /content/maths/euler-phi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/euler-phi.cpp -------------------------------------------------------------------------------- /content/maths/extended-gcd.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/extended-gcd.cpp -------------------------------------------------------------------------------- /content/maths/factorial.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/factorial.cpp -------------------------------------------------------------------------------- /content/maths/fast-ntt.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/fast-ntt.cpp -------------------------------------------------------------------------------- /content/maths/fast-prime-factorization.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/fast-prime-factorization.cpp -------------------------------------------------------------------------------- /content/maths/fft.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/fft.cpp -------------------------------------------------------------------------------- /content/maths/fraction.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/fraction.cpp -------------------------------------------------------------------------------- /content/maths/fwht.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/fwht.cpp -------------------------------------------------------------------------------- /content/maths/gauss.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/gauss.cpp -------------------------------------------------------------------------------- /content/maths/lagrange-point.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/lagrange-point.cpp -------------------------------------------------------------------------------- /content/maths/matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/matrix.cpp -------------------------------------------------------------------------------- /content/maths/miller-rabin.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/miller-rabin.cpp -------------------------------------------------------------------------------- /content/maths/mobius-sieve.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/mobius-sieve.cpp -------------------------------------------------------------------------------- /content/maths/montgomery.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/montgomery.cpp -------------------------------------------------------------------------------- /content/maths/mulmod.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/mulmod.cpp -------------------------------------------------------------------------------- /content/maths/non-deterministic-miller-rabin.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/non-deterministic-miller-rabin.cpp -------------------------------------------------------------------------------- /content/maths/ntt.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/ntt.cpp -------------------------------------------------------------------------------- /content/maths/pollard-rho.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/pollard-rho.cpp -------------------------------------------------------------------------------- /content/maths/poly-shift.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/poly-shift.cpp -------------------------------------------------------------------------------- /content/maths/prime-factors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/prime-factors.cpp -------------------------------------------------------------------------------- /content/maths/sieveking-kung.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/sieveking-kung.cpp -------------------------------------------------------------------------------- /content/maths/simplex.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/simplex.cpp -------------------------------------------------------------------------------- /content/maths/tetration.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/tetration.cpp -------------------------------------------------------------------------------- /content/maths/xor-basis.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/maths/xor-basis.cpp -------------------------------------------------------------------------------- /content/strings/aho-corasick.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/aho-corasick.cpp -------------------------------------------------------------------------------- /content/strings/k-rolling-hashing.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/k-rolling-hashing.cpp -------------------------------------------------------------------------------- /content/strings/kmp.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/kmp.cpp -------------------------------------------------------------------------------- /content/strings/manacher.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/manacher.cpp -------------------------------------------------------------------------------- /content/strings/min-rotation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/min-rotation.cpp -------------------------------------------------------------------------------- /content/strings/rolling-hashing.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/rolling-hashing.cpp -------------------------------------------------------------------------------- /content/strings/suffix-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/suffix-array.cpp -------------------------------------------------------------------------------- /content/strings/suffix-automaton.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/suffix-automaton.cpp -------------------------------------------------------------------------------- /content/strings/trie.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/trie.cpp -------------------------------------------------------------------------------- /content/strings/z.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/content/strings/z.cpp -------------------------------------------------------------------------------- /img/utfsm_cp.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/img/utfsm_cp.png -------------------------------------------------------------------------------- /lib/hash.typ: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/lib/hash.typ -------------------------------------------------------------------------------- /lib/hash.wasm: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/lib/hash.wasm -------------------------------------------------------------------------------- /main.typ: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/main.typ -------------------------------------------------------------------------------- /scripts/check-tracker.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/scripts/check-tracker.py -------------------------------------------------------------------------------- /tracker.yaml: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/ProgramacionCompetitivaUTFSM/Handbook-USM/HEAD/tracker.yaml --------------------------------------------------------------------------------