Introduction
Math
1.
Sieve
2.
GCD, LCM
3.
Extended Euclidean Algorithm
4.
Chinese Remainder Theorem
5.
Deterministic Miller-Rabin Primality Test
6.
Pollard's Rho Algorithm
7.
Number Theoretic Transform
8.
Linear Recurrence
8.1.
Berlekamp-Massey
8.2.
Kitamasa
8.3.
Bostan-Mori
9.
Integer Square Root
Data Structures
10.
2D Matrix
11.
Disjoint Set Union
11.1.
Weighted DSU
12.
Segment Trees
12.1.
Segment Tree
12.2.
Fenwick Tree
12.3.
Lazy Segment Tree
13.
Rope
14.
Bitset
Graphs
15.
Dijkstra
15.1.
Dial
16.
Strongly Connected Components
17.
2-SAT
18.
Heavy-Light Decomposition
19.
Flow
19.1.
Dinic's Algorithm
19.2.
MCMF
Strings
20.
KMP
21.
Manacher
22.
Suffix Array and LCP Array
Geometry
23.
2D Geometry Base
24.
Angle Comparator
25.
Convex Hull
26.
Line Intersection
27.
Closest Points
28.
Farthest Points
29.
Point in a Polygon
30.
Point in a Convex Polygon
31.
Mincowski Sum of Convex Polygons
Unclassified
32.
Value Compression
33.
Longest Increasing Subsequence
34.
Mo's
35.
Arbitrary-Precision Integer
36.
Fraction
Misc
37.
Fast IO
38.
Iterator Tools
39.
Macros
Deprecated
40.
Adjacency List Graph Representation
41.
Zero/One Trait
42.
Deprecated Macros
Nord Light
Nord Dark
Navy
Coal
Ayu
Rust Snippets for Competitive Programming
Segment Trees
Segment trees are a category of data structures which can handle range queries efficiently.