ecnerwala/cp-book

Book Code for Competitive Programming

Hi there 👋

cp-book's Issues

Dirichlet series/number theoretic functions

• div_vector; container bucketed by sqrt
• multiplication
• inverse / sqrt
• prime count (exp/log)
• fraction for euler transform
• sparse series

Benchmark things

• seg_tree
• bit
• fft

Geometry

• Point2D
• 2d utilities
• 2d hull
• Circumcircle
• min-enclosing disk
• Point3D
• 3d hull
• Delaunay triangulation

LCA

More tree primitives, like distance to LCA, last node before LCA, kth node on path, etc

Examples

This is a great repo, but I'm not sure how to use it.
Do you think you could add some examples or explanations on how to use the code, please?

Modular class

Hello, just want to ask if you can share your mod class!

Directed MST

See old book

FFT and Polynomials

Algorithms

• multiply_inverser
• polynomial / power series class
• integ/deriv/exp/log/pow
• interpolation/multipoint
• GCD

Interface

• square
• fused multiply-add, or at least something more generic than multiply
• multiply-with-size
• multiply-inner
• policy-based design, see https://www.fluentcpp.com/2018/06/22/variadic-crtp-opt-in-for-class-features-at-compile-time/

Faster flows