Cloak HN: Fine quality offer of algorithms/DS for competitive programming

I’ve infrequently seen sources of algorithms/info constructions posted on HN, nevertheless they’ve mostly been somewhat low quality. This offer turn out to be as soon as created/maintained for the International Collegiate Programming Competitors, which has a 25 page limit.

Amongst others, the final 3 MIT ICPC teams own aged a variant of this notebook.

Some dapper issues in this notebook:

The fastest 64 bit mod mul implementation I’ve seen (uses doubles and proven factual): https://github.com/kth-competitive-programming/kactl/blob/grasp/drawl/quantity-belief/ModMulLL.h

A rapid/rapid implementation of FFT: https://github.com/kth-competitive-programming/kactl/blob/grasp/drawl/numerical/FastFourierTransform.h

A bump allocator: https://github.com/kth-competitive-programming/kactl/blob/grasp/drawl/diverse/BumpAllocator.h