Implementing FFT
A derivation-oriented guide to FFT implementations, moving from recursive Cooley-Tukey to iterative and in-place variants without explicit bit reversal.
A derivation-oriented guide to FFT implementations, moving from recursive Cooley-Tukey to iterative and in-place variants without explicit bit reversal.
A C++ template for recursive DP with automatic memoization, built from recursive lambdas, generalized hashing, and policy-based hash tables.
A practical introduction to the Akra-Bazzi theorem as a way to analyze divide-and-conquer recurrences with unequal splits, floors, and offsets.
The Boost C++ library and examples of what it would give competitive programmers beyond the standard library.
A short PSA on increasing stack limits before MHC, with commands, compiler flags, and platform caveats.
A tour of Floyd-Warshall as an instance of aggregating over graph paths, leading to transitive closure, Kleene algebras, and the algebraic path problem.
A user-written editorial for Codeforces Round 513, which did not have an editorial before.
On preserving Google Hash Code problems and infrastructure before the contest archive disappears.
Suggestions for improving the Codeforces Catalog.
A guide to permutations through orderings, cycles, and composition, with pointers to common competitive-programming applications.
Notes from testing and preparing programming contests.
A tutorial on greedoids as a framework for understanding when greedy-style reasoning works, with examples from matroids, antimatroids, and related structures.
A detailed competitive-programming setup guide for Vim, Make, and GDB, covering both onsite contest constraints and online practice.
A discussion of using C on Codeforces.
A tutorial on Catalan numbers and uniform random balanced bracket generation, building bijections and generators from first principles.
The announcement for InterviewForces Contest #1, a Codeforces-style meme contest with nine problems.