Credits for make: https://github.com/kth-competitive-programming/kactl/

make pdf
python test.py

do test.py można dać ścieżkę do odpowiedniego folderu jak chce się wytestować mniej kodów. Wtedy i tak odpowiednio zmodyfikuje poniższą todolistę.

• geo/geo3d
• data-structures/associative-queue
• data-structures/fenwick-tree
• data-structures/fenwick-tree-2d
• data-structures/find-union
• data-structures/hash-map
• data-structures/lazy-segment-tree
• data-structures/lichao-tree
• data-structures/line-container
• data-structures/link-cut
• data-structures/majorized-set
• data-structures/ordered-set
• data-structures/persistent-treap
• data-structures/range-add
• data-structures/rmq
• data-structures/segment-tree
• data-structures/treap
• flow/blossom
• flow/dinic
• flow/gomory-hu
• flow/hopcroft-karp
• flow/hungarian
• flow/konig-theorem
• flow/matching
• flow/mcmf-dijkstra
• flow/mcmf-spfa
• geo/advanced-complex
• geo/angle-sort
• geo/angle180-intervals
• geo/area
• geo/circle-intersection
• geo/circle-tangents
• geo/closest-pair
• geo/convex-gen
• geo/convex-hull
• geo/convex-hull-online
• geo/delaunay-triangulation
• geo/furthest-pair
• geo/halfplane-intersection
• geo/intersect-lines
• geo/is-in-hull
• geo/line
• geo/point
• geo/polygon-gen
• geo/polygon-print
• geo/voronoi-diagram
• graph/2sat
• graph/biconnected
• graph/cactus-cycles
• graph/centro-decomp
• graph/coloring
• graph/de-brujin
• graph/directed-mst
• graph/dominator-tree
• graph/dynamic-connectivity
• graph/eulerian-path
• graph/hld
• graph/hld-online-bottom-up
• graph/jump-ptr
• graph/line-graph-inverse
• graph/max-clique
• graph/negative-cycle
• graph/planar-graph-faces
• graph/planarity-check
• graph/scc
• graph/toposort
• graph/triangles
• math/berlekamp-massey
• math/bignum
• math/binsearch-stern-brocot
• math/crt
• math/determinant
• math/discrete-log
• math/discrete-root
• math/extended-gcd
• math/fft
• math/fft-mod
• math/floor-sum
• math/fwht
• math/gauss
• math/integral
• math/lagrange-consecutive
• math/matrix-header
• math/matrix-inverse
• math/miller-rabin
• math/mod-int
• math/multiplicative
• math/ntt
• math/pell
• math/pi
• math/polynomial
• math/power-sum
• math/primitive-root
• math/pythagorean-triples
• math/rho-pollard
• math/same-div
• math/sieve
• math/simple-modulo
• math/simplex
• math/tonelli-shanks
• math/xor-base
• optimizations/divide-and-conquer-dp
• optimizations/dp-1d1d
• optimizations/fio
• optimizations/knuth
• optimizations/linear-knapsack
• optimizations/pragmy
• optimizations/random
• optimizations/sos-dp
• string/aho-corasick
• string/eertree
• string/hashing
• string/kmp
• string/lyndon-min-cyclic-rot
• string/manacher
• string/pref
• string/squares
• string/suffix-array-interval
• string/suffix-array-long
• string/suffix-array-short
• string/suffix-automaton
• string/suffix-tree
• string/wildcard-matching
• utils/dzien-probny
• utils/example-code
• utils/print-tree