• i. C++ for Competitive Programming: The language-level facts that decide WA/TLE/RE before any algorithm does.
• ii. Fast I/O and Constant Factor: Use this when the complexity is right but the time limit isn’t.
• iii. Complexity, Constraints and Amortized Analysis: Read the constraints, compute the real operation count, and that number tells you the intended solution.
• iv. Debugging and Stress Testing: Most lost contests come from bugs you could not see, not from algorithms you did not know.
• v. Interactive Problems: In an interactive problem your program talks to a judge program.
• vi. Contest Strategy: How to read, think, code and spend time, for individual rounds (Codeforces, AtCoder) and team contests (ICPC).
• vii. Implementation Techniques and Reliability: Two skills that decide ICPC results as much as algorithms:
• viii. STL and Libraries Reference: When to use which part of the C++ standard library, what every operation costs and invalidates, and what the common contest libraries provide.