SegmentTree, LazySegmentTree (replace with ours)
Polynomial
GoldenSectionSearch
PolyRoots
Simplex
ModMulLL
Bezout's identity
The Twelvefold Way
Derangements
Stirling numbers of the first kind
Eulerian numbers
Burnside's lemma
Partition function
Stirling numbers of the second kind
Bell numbers
Super Catalan numbers
Motzkin numbers
DFSMatching
CompressTree (what does it do?)
MatrixTree
ClosestPair (of points)
IntervalCover
ConstantInterval
Karatsuba
Smazali jsme většinu následujících věcí. Teď je ale na čase něco z toho vrátit, protože se to ukázalo jako potenciálně použitelné.
Definitely
SubMatrix Treap (use ours) PolyInterpolate HillClimbing Integrate IntegrateAdaptive Determinant IntDeterminant Tridiagonal ModPow (use ours) ModSum Eratosthenes (use ours) MillerRabin (use ours) euclid.h, Euclid.java Factorial Cycles (wtf is this) Involutions Triangles Narayana numbers Schröder numbers HLD (use ours) SphericalDistance BumpAllocator, SmallPtr, BumpAllocatorSTL Unrolling SIMD Techniques
Maybe
SegmentTree, LazySegmentTree (replace with ours) Polynomial GoldenSectionSearch PolyRoots Simplex ModMulLL Bezout's identity The Twelvefold Way Derangements Stirling numbers of the first kind Eulerian numbers Burnside's lemma Partition function Stirling numbers of the second kind Bell numbers Super Catalan numbers Motzkin numbers DFSMatching CompressTree (what does it do?) MatrixTree ClosestPair (of points) IntervalCover ConstantInterval Karatsuba