← Back to Course Center
CSP-S Training
Course Overview
The CSP-S (Senior) preliminary intensive camp serves students who completed CSP-J with solid C++ and entry algorithms—a systematic sprint toward the Senior preliminary exam. Thirteen sessions build progressively from core topics to contest practice and complete Senior knowledge.
Included Courses
Concept Lectures
Mock Tests & Review
Competency Goals
Advanced Programming & Contest Problem Solving
Full CSP-S preliminary training, advanced number theory/graph/combinatorics drills, and mocks strengthen decomposition, efficient coding, and boundary testing.
Deep Computational Thinking
From low-level CS and math through structures, advanced graphs, and optimizations—abstraction, complexity, transformation, and Senior systematic thinking.
Engineering Program Design
Efficient STL use, modular code, multi-solution comparison, and contest debugging—time/space efficiency and robustness.
Cross-Domain Integration
CS, number theory, combinatorics, and graphs merge in complex preliminary problems.
Contest Practice & Exam Strategy
Five full mocks and paper review for CSP-S format, pacing, scoring, time allocation, and error avoidance.
Course Advantages
Full CSP-S Preliminary Coverage
Linux, bit operations, number theory, combinatorics, STL, tree/graph algorithms, search optimization—complete scope.
Progressive Advancement
Foundations to advanced algorithms to integrated practice—steady Senior preliminary framework.
Teach, Practice, Absorb
Targeted drills each session, same-day consolidation, STL and graph topic breakthroughs for speed and accuracy.
Five Full Mocks
Five simulated exams with review—contest atmosphere, preliminary pacing, and gap closure.
Senior-Targeted Training
High-frequency topics and common pitfalls—number theory, combinatorics, tree/graph modules—for scoring and awards.
📋 Sample Lessons (Trial)
1
Lesson 1: Bitwise Operations
Free trial
2
Lesson 2: Hashing & Hash Collisions
Free trial