algo

[cameroncuster]

P0

• [x] BCC
• [ ] compress tree
• [x] extended euclidian
• [ ] factor big numbers
• [x] HLD
• [x] max flow
• [x] max matching
• [x] min cost max flow
• [x] NTT
• [ ] string hashing
• [x] 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