Introduces CP formats, common OJ platforms, verdicts, and the mindset you need to thrive.
Covers the fast, stable, and accurate toolchain you need: compilers, IDEs, I/O tweaks, and file redirection.
Walks through the most practical STL containers and algorithms that form the core toolkit for contests.
Teaches how to judge time and space complexity, apply the 10^8 rule, and pick algorithms by input size.
Shows when pure simulation or brute force is the right tool, including pruning and bitmask enumeration.
Covers custom sorting, binary search (including search-on-answer), two pointers, and discretization tricks.
Covers GCD/LCM, primality testing, and modular arithmetic with fast exponentiation.
Walks through bitwise operators, bitmask tricks, lowbit, and GCC built-ins for efficient set handling.
Explains 1D/2D prefix sums and difference arrays for fast queries and range updates.