Small advertisement : "Introduction to Advanced Algorithm Competition" won the " Tsinghua University Press Annual Bestseller " in 2019 and 2020 . Online shopping: Jingdong Dangdang has been on discount recently. Author's signed book: click me
The column "Daily Question of the Blue Bridge Cup" analyzes the real questions of Group A of the three provincial competitions from 2017 to 2019.
This work is suspended.
This blog will continue to write a series of articles on "Special Analysis of Algorithm Competitions", and readers are welcome to give more comments.
Article directory
The 10 topics of the 2019 provincial software category group A have all been analyzed in the previous blog post. Collection: https://blog.csdn.net/weixin_43914593/category_10721247.html
1. 2019 Blue Bridge Cup Software University Group A Topics
Topic: https://www.lanqiao.cn/courses/2786/learning/?id=67813
There are 10 questions in total, including fill-in-the-blank and coding questions.
| Question number | topic | Question type | Score | Link | difficulty | illustrate |
|---|---|---|---|---|---|---|
| 1 | sum of squares | Fill in the blanks | 5 | http://oj.ecustacm.cn/problem.php?id=1452 | * | number |
| 2 | Sequence evaluation | Fill in the blanks | 5 | http://oj.ecustacm.cn/problem.php?id=1453 | * | number |
| 3 | maximum rainfall | Fill in the blanks | 10 | http://oj.ecustacm.cn/problem.php?id=1454 | * | thinking |
| 4 | maze | Fill in the blanks | 10 | http://oj.ecustacm.cn/problem.php?id=1455 | ** | BFS + shortest path |
| 5 | RSA decryption | Fill in the blanks | 15 | http://oj.ecustacm.cn/problem.php?id=1456 | ** | fast power |
| 6 | value of complete binary tree | programming | 15 | http://oj.ecustacm.cn/problem.php?id=1457 | * | Binary tree simulation |
| 7 | Takeaway priority | programming | 20 | http://oj.ecustacm.cn/problem.php?id=1458 | ** | simulation |
| 8 | modify the array | programming | 20 | http://oj.ecustacm.cn/problem.php?id=1459 | *** | and check |
| 9 | candy | programming | 25 | http://oj.ecustacm.cn/problem.php?id=1460 | **** | State Compression DP |
| 10 | Combination number problem | programming | 25 | http://oj.ecustacm.cn/problem.php?id=1461 | **** | Number Theory, Lucas Theorem |
Divided by difficulty:
1 star: 4 questions
, 2 stars: 3 questions, 3 stars
: 1 question
, 4 stars: 2 questions
, 5 stars: 0 questions
Total number of stars: 21.
2. Description
Question 1: Numbers, very easy
Question 2: Numbers, extremely easy
Question 3: Simple thinking, easy
Question 4: Use BFS to find the shortest path and print the path, which is relatively easy. A good basic question.
Question 5: Fast power, relatively easy
Question 6: Binary tree simulation, easy Question
7: Simulation, relatively easy, the question is OK Lucas theorem, the title is ok