algo

[cameroncuster]

P0

• BCC
• compress tree
• extended euclidian
• factor big numbers
• HLD
• max flow
• max matching
• min cost max flow
• NTT
• string hashing
• suffix array
• interval container
• equivalent of c++'s policy based BST

[cameroncuster]

for mod-int we went with compile time known mod (subject to change)

[cameroncuster]

for dfs, we do not have a solution to using a million params ATM

considered iterative DFS or some implementation of a recursive closure in rust, but haven't found a great one yet

[lrvideckis]

todo: integrate atcoder mod int

[lrvideckis]

we should also start adding #[inline] everywhere where it makes sense

[lrvideckis]

let's add back dsu because of the better return value of "merge"

[cameroncuster]

haha shoot fair