" Algorithm Competition " will be published in October 2022, online shopping: Jingdong Tmall Dangdang
author's signature book (25% off + express delivery), please add WeChat (mobile phone number is WeChat): 13916333036
Blue Bridge Cup official preparation guide " Programming Competition Special Challenge Course " Published in December 2022
Online shopping : Jingdong Dangdang Taobao
This year's Blue Bridge Cup software topic, everyone said that it was more difficult than last year. The main reasons are:
(1) "Fill in the blanks" has been reduced from 5 questions to 2 questions, and "program design" has been increased from 5 questions to 8 questions.
(2) Added some new algorithm test points, such as line segment tree, game theory, probability, inverse element, computational geometry, etc. Moreover, many questions are mixed questions combining multiple knowledge points, which increases the difficulty. The line segment tree appeared for the first time this year, and there are several questions: "XOR of number selection, longest non-decreasing subsequence, scanning game, reordering". The presence of a segment tree may be a weathervane. The knowledge point of the line segment tree, I evaluated in the new book " Algorithm Competition
" to be published by Tsinghua University Press in July this year : "The line segment tree can be said to be the most advanced data structure that the contestants like to assess. The line segment tree is a milestone knowledge point. Mastering the line segment tree marks the departure from the primary learning stage and entering the intermediate and advanced learning stage." There are 12 provincial competitions this year according to grouping . Some questions appear repeatedly, for example, "Paper Cutter" appears 5 times, Pioneer of Rat Extermination appears 4 times, and so on. There are many repetitions among group A, group C and postgraduate group. What is more strange is group B. Among them, each question in group C/C++ B and Java B only appeared once. But overall, the repetition rate of this year's questions is much lower than in previous years. The table below lists all the Blue Bridge Cup Provincial Championships this year. I estimated the difficulty, please see if it is reasonable. If you have any suggestions, please add QQ group: 567554289, or contact QQ: 15512356 Attachment: (1) All previous years’ topics: https://www.lanqiao.cn/courses/2786 (2) This year’s topics: http://oj.ecustacm.cn/viewnews.php?id=1021 https://www.dotcpp.com/oj/problemset.php?page=24& mark=6
(3) Fu Zhiling (a member of East China University of Science and Technology) analyzed the topic of C/C++ Group A: https://blog.csdn.net/fzl194/article/details/124347039
Fu Zhiling is the owner and administrator of http://oj.ecustacm.cn
2022 The 13th Blue Bridge Cup Competition Software Category
1. C/C++
The number after the question in the table is the difficulty, 1 is the least difficult and 5 is the most difficult .
| Question number | University Group A | University Group B | University Group C | Postgraduate group |
|---|---|---|---|---|
| A | paper cutter 1 | Nine to decimal 1 | Arrange letters 1 | paper cutter 1 |
| B | Rodent Pioneer 4 | Straight Date 1 | special time 2 | Rodent Pioneer 4 |
| C | Sum 2 | Brush question statistics 2 | paper size 2 | prime factor number 2 |
| D | XOR 3 | pruning shrubs 2 | Sum 2 | XOR 3 |
| E | tree climbing beetle 4 | X base subtraction 3 | digit sort 2 | GCD 2 |
| F | Frogger 3 | Statistics Submatrix 3 | XOR 3 | tree climbing beetle 4 |
| G | longest non-decreasing subsequence 5 | Block painting 4 | Elimination Game 4 | Full permutation value 4 |
| H | scan game 5 | Minesweeper 4 | Reorder 4 | scan game 5 |
| I | Number of splits 4 | Li Bai Dajiu Enhanced Edition 4 | Skill Upgrade 4 | Number of splits 4 |
| J | derivation part and 4 | cut bamboo 4 | repeating number 4 | repeating number 4 |
| difficulty | 35 | 28 | 28 | 33 |
2. Java
| Question number | University Group A | University Group B | University Group C | Postgraduate group |
|---|---|---|---|---|
| A | paper cutter 1 | week calculation 1 | Arrange letters 1 | Arrange letters 1 |
| B | Find the integer 2 | Mountain 1 | special time 2 | Rodent Pioneer 4 |
| C | Sum 2 | Character Statistics 2 | paper size 2 | prime factor number 2 |
| D | GCD 2 | The minimum number of brush questions is 3 | Sum 2 | digit sort 2 |
| E | Hive 4 | Find factorial 3 | Rectangular Stitching 3 | Hive 4 |
| F | Full permutation value 4 | Maximum Submatrix 4 | XOR 3 | tree climbing beetle 4 |
| G | Frogger 3 | Array Slicing 4 | GCD 2 | Reorder 4 |
| H | factor sum of squares 4 | Memory Maze 4 | Frogger 3 | Skill Upgrade 4 |
| I | Optimal Clearing Scheme 5 | traffic light 4 | factor sum of squares 4 | Optimal Clearing Scheme 5 |
| J | derivation part and 4 | Pull the box 4 | longest non-decreasing subsequence 5 | derivation part and 4 |
| difficulty | 31 | 30 | 27 | 34 |
2. Python
| Question number | University Group A | University Group B | University Group C | Postgraduate group |
|---|---|---|---|---|
| A | paper cutter 1 | Arrange letters 1 | Arrange letters 1 | paper cutter 1 |
| B | Find the integer 2 | Find the integer 2 | special time 2 | Find the integer 2 |
| C | prime factor number 2 | paper size 2 | paper size 2 | prime factor number 2 |
| D | Rectangular Stitching 3 | digit sort 2 | digit sort 2 | Rectangular Stitching 3 |
| E | Elimination Game 4 | Hive 4 | Rectangular Stitching 3 | Elimination Game 4 |
| F | Reorder 4 | Elimination Game 4 | GCD 2 | tree climbing beetle 4 |
| G | Full permutation value 4 | Full permutation value 4 | hive 4 | Skill Upgrade 4 |
| H | longest non-decreasing subsequence 5 | Skill Upgrade 4 | Reorder 4 | factor sum of squares 4 |
| I | Optimal Clearing Scheme 5 | longest non-decreasing subsequence 5 | Frogger 3 | scan game 5 |
| J | Number of splits 4 | Optimal Clearing Scheme 5 | factor sum of squares 4 | Number of splits 4 |
| difficulty | 34 | 33 | 27 | 33 |