$grep "math" --all
76 templates
template_math-utilities.cpp

Math Utilities

[Utilities]

Base conversion, range summation, counting/summing multiples, and log base.

#base-conversion#summation#multiples+1
$ cat math-uti..
template_big-integer.cpp

Big Integer

[Utilities]

Non-negative arbitrary-precision integer with addition, subtraction, multiplication, division, and modulo.

#bigint#arbitrary-precision#big-integer+1
$ cat big-inte..
template_kuhn-matching.cpp

Kuhn's Matching

[Graph]

Maximum bipartite matching via augmenting paths in O(V*E).

#bipartite#matching#kuhn+1
$ cat kuhn-mat..
template_matrix-exponentiation.cpp

Matrix Exponentiation

[Number Theory]

Binary exponentiation on square matrices for solving linear recurrences in O(n^3 log k).

#matrix#exponentiation#linear-recurrence+1
$ cat matrix-e..
template_lca-weighted.cpp

LCA Weighted

[Graph]

LCA with path aggregate queries (sum/max/min) on weighted trees using binary lifting in O(log n).

#lca#binary-lifting#weighted-tree+2
$ cat lca-weig..
template_bellman-ford.cpp

Bellman-Ford

[Graph]

Shortest path with negative edge weights and negative cycle detection in O(V*E).

#bellman-ford#shortest-path#negative-weights+1
$ cat bellman-..
template_dijkstra.cpp

Dijkstra's Algorithm

[Graph]

Shortest path in non-negative weighted graphs using priority queue relaxation in O((V+E) log V).

#dijkstra#shortest-path#priority-queue+1
$ cat dijkstra
template_segment-tree-2d.cpp

2D Segment Tree

[Data Structures]

Nested segment tree for 2D point update and rectangle queries in O(log n * log m).

#segment-tree#2d#matrix+1
$ cat segment-..
template_persistent-segment-tree.cpp

Persistent Segment Tree

[Data Structures]

Segment tree preserving all versions via path copying — O(log n) per update, O(n + q log n) total memory.

#persistent#segment-tree#versioned+1
$ cat persiste..
template_link-cut-tree.cpp

Link-Cut Tree

[Data Structures]

Dynamic forest structure supporting link, cut, and path queries in O(log n) amortized.

#link-cut-tree#splay#dynamic-tree+1
$ cat link-cut..
template_hld.cpp

Heavy-Light Decomposition

[Data Structures]

Decomposes a tree into chains for O(log^2 n) path queries using a segment tree.

#hld#heavy-light#decomposition+2
$ cat hld
template_fenwick-tree-2d.cpp

2D Fenwick Tree

[Data Structures]

2D Binary Indexed Tree for point updates and rectangle sum queries in O(log n * log m).

#fenwick#bit#2d+2
$ cat fenwick-..
template_dsu.cpp

DSU

[Data Structures]

Disjoint Set Union with path compression and union by size in near-constant amortized time.

#dsu#union-find#disjoint-set+1
$ cat dsu
template_modular-inverse.cpp

Modular Inverse

[Algebra]
1

Modular multiplicative inverse via Fermat's little theorem, extended Euclidean, and linear precomputation.

#modular-inverse#fermat#extended-gcd+1
$ cat modular-..
template_kmp.cpp

KMP Algorithm

[Strings]

Knuth-Morris-Pratt pattern matching and prefix function in O(n + m).

#kmp#pattern-matching#prefix-function+1
$ cat kmp
template_floyd-warshall.cpp

Floyd-Warshall

[Graph]

All-pairs shortest paths via O(V^3) dynamic programming on the adjacency matrix.

#floyd-warshall#all-pairs#shortest-path+2
$ cat floyd-wa..