Expand description
algorithm
Structs§
- Black
BoxAutomaton Impl - Cartesian
Tree - Combinations
- Convex
Hull Trick - Deterministic
Finite Automaton - DfaLearning
- Esper
Estimator - Esper
Solver - Impartial
Game Analyzer - Impartial
Gamer - Independent
SubSet - Partisan
Game Analyzer - Partisan
Gamer - RhoPath
- $P_0 =$
init, $P_{i+1} = next(P_i)$ - SbtNode
- SbtPath
- Sqrt
Decomposition Buckets - Subsets
- Weighted
Finite Automaton - WfaLearning
- XorBasis
- Basis of xor operation.
- Zero
SumGame Analyzer - Zero
SumGamer
Traits§
- Bisect
- binary search helper
- BitDp
Ext - Black
BoxAutomaton - Impartial
Game - Partisan
Game - Slice
Bisect Ext - binary search for slice
- Slice
Combinations Ext - Slice
Sort Ext - Sqrt
Decomposition - Stern
Brocot Tree - Zero
SumGame
Functions§
- baby_
step_ giant_ step - $\min{0\le i < n | x^i=y}$
- binary_
search - binary search for monotone segment
- dense_
sampling - floor_
kernel - $y = \left\lfloor\frac{n}{x}\right\rfloor$
- parallel_
binary_ search - random_
sampling - run_
length_ encoding - return: [(elem, length)]
- solve_
01_ on_ tree - ternary_
search - Returns the element that gives the minimum value from the strictly concave up function and the minimum value.