Detailed Explanation of the GESP Examination Syllabus | C++ Level 8Grade Examination of Software ProgrammingC++ Certification Knowledge System (Level 8)1. Assessment Objectives
Master the basic principles of counting, understand the differences and applications of the addition and multiplication principles. Grasp the concepts of permutations and combinations, and be able to implement programming solutions for common permutation and combination problems. Understand the concept and applications of Pascal’s triangle, and its relationship with combinations. Master basic knowledge of algebra and plane geometry (limited to middle school mathematics), be able to solve linear equations and understand basic concepts of plane geometry. Understand the time complexity and space complexity analysis methods for more complex algorithms, as well as general algorithm optimization techniques, and be able to optimize algorithms based on mathematical knowledge.
2. Knowledge Content
-
Counting Principles
-
Permutations and Combinations
-
Pascal’s Triangle
-
Doubling Method
-
Algebra and Plane Geometry (Middle School Mathematics)
-
Graph Theory Algorithms and Comprehensive Applications (Minimum Spanning Tree, Single Source Shortest Path)
-
Space Complexity and Time Complexity of More Complex Algorithms
-
Algorithm Optimization
3. Knowledge Blocks and Descriptions
Knowledge Points
| ID | Description of Knowledge Points |
| 1 | Principle of Addition Principle of Multiplication |
| 2 | Permutations Combinations |
| 3 | Definition of Pascal’s Triangle Implementation of Pascal’s Triangle |
| 4 | Concept of Doubling |
| 5 | Linear Equations Quadratic Equations Area of Triangle, Circle, Rectangle |
| 6 | Concept of Minimum Spanning Tree, Kruskal’s Algorithm, Prim’s Algorithm Concept of Shortest Path, Dijkstra’s Algorithm, Floyd’s Algorithm Comprehensive Application of Graph Theory Algorithms and Problem Solving Techniques |
| 7 | General Analysis Methods for Algorithm Time and Space Complexity Time and Space Complexity of Various Algorithms (including Sorting Algorithms, Searching Algorithms, Tree and Graph Traversal Algorithms, Search Algorithms, Divide and Conquer, and Dynamic Programming Algorithms) |
| 8 | Analysis of Differences in Problem Solving by Different Algorithms General Methods of Algorithm Optimization General Methods of Optimizing Algorithms Based on Mathematical Knowledge (including but not limited to the summation formulas for arithmetic and geometric series) |
4. Detailed Description of Knowledge Points
Knowledge Details
01
Master the principles of counting, including the addition and multiplication principles.
02
Master the basic knowledge of permutations and combinations, including the basic concepts of permutations and combinations, and the general methods for implementing basic programming problems related to permutations and combinations.
03
Understand the concept of Pascal’s Triangle (also known as the Triangle of Pascal).
04
Understand the concept of the doubling method and its time complexity.
05
Master the basic knowledge of algebra and plane geometry (middle school mathematics), including the concept of equations and basic solving techniques for linear and quadratic equations, as well as calculating the area of basic geometric shapes (such as rectangles, triangles, circles, etc.).
06
Master graph theory algorithms and comprehensive application techniques, including the concept of minimum spanning trees, Kruskal’s algorithm, Prim’s algorithm, and the concept of shortest paths, including Dijkstra’s algorithm and Floyd’s algorithm. Understand the comparison of different algorithms that achieve the same functionality and be able to flexibly solve related problems.
07
Analyze the time and space efficiency of algorithms. Be able to master the analysis methods for time and space complexity of more complex algorithms, and analyze the time and space complexity of various algorithms (including sorting algorithms, searching algorithms, tree and graph traversal algorithms, search algorithms, divide and conquer, and dynamic programming algorithms).
08
Algorithm optimization. Understand the differences in time and space complexity when solving a problem using different methods, and understand the techniques for using mathematical knowledge to assist in problem-solving (for example, using loops to calculate the sum of an arithmetic series or using mathematical formulas to calculate the sum of an arithmetic series), and master general algorithm optimization techniques.
5. Question Type Distribution
Examinations
| Multiple Choice Questions | True/False Questions | Programming Questions |
| 15 questions (2 points each) | 10 questions (2 points each) | 2 questions (25 points each) |
Exam Duration:180 minutesOnline Judge ProblemsOnline Real Questions
Past programming questions can be directly practiced online on the Luogu website.
The list of questions is organized as follows, and the question list URL is:
https://www.luogu.com.cn/training/558#problems
In addition, you can also directly find past real questions on the GESP official website, the URL is:
https://gesp.ccf.org.cn/101/1010/index.html
As of now (September 2025), there are a total of 7 sets of real questions, and the corresponding solutions can be found directly in the CCF GESP official WeChat account, with the relevant article links organized as follows:
-
December 2023, Solution Analysis / Review of GESP December Certification C++ Level 8 Real Questions
-
March 2024, Solution Analysis of the Fifth GESP Certification | Review of C++ Level 8 Real Questions
-
June 2024, Solution Analysis of the Sixth GESP Certification | Review of C++ Level 8 Real Questions
-
September 2024, Solution Analysis of the Seventh GESP Certification | Review of C++ Level 8 Real Questions
-
December 2024, Solution Analysis of the Eighth GESP Certification | Review of C++ Level 8 Real Questions
-
March 2025, Solution Analysis of the Ninth GESP Certification | Review of C++ Level 8 Real Questions
-
June 2025, Solution Analysis of the Tenth GESP Certification | Review of C++ Level 8 Real Questions
Note:The registration for the 11th certification will close on the 16th of this month, so students should prepare in time. Students who are not sufficiently prepared can first practice a wave of real questions. Since the past real questions provided by the GESP official website come with answers, they are not convenient for printing for self-testing training, so I have organized a set of printable real questions without answers, and the method to obtain them is as follows: Click on the above
Follow us
After following, send a message in the WeChat account:“GESP C++“, to obtain GESP C++ past real question materials, including both answered and unanswered real questions.
After completing the real questions, we can also go to some online assessment systems (OJ) to do programming questions for further training.
More ProblemsProgramming Practice
#include <bits/stdc++.h>
using namespace std;
int main() {
cout << "AK GESP C++";
return 0;
}
// Follow us for more information and materials
/*
* Information Technology Exchange
* Code Knowledge Sharing
* Programming Problem Solving
* Promoting Science and Technology Education
*/
For most middle and primary school students nationwide, they can practice programming questions on the Luogu platform, and can also practice on the Shanghai Computer Society Competition Platform according to star levels. Of course, Zhejiang also has many excellent OJ platforms from various informatics institutions that provide free programming practice and programming competitions/monthly contests, so everyone can participate more to promote learning through competition. If you have any questions or ideas, feel free to discuss!
Scan to add friends for discussion Add friends | Note “C++”