题单总览¶
本页汇总本手册配套训练计划的全部题目，按「寒假 LeetCode / 暑假 LeetCode / ACM 暑假集训 Day1-13」三部分组织，与《题单汇总与验证》保持完全同步。每道题标注题号、题目名称、难度、考点和完成状态。
使用说明：在每道题前的
[ ]中填入x表示已完成，如- [x]
数据口径
本页题目均已通过验证（LeetCode GraphQL API、Codeforces Problemset API、AtCoder/洛谷 HTTP 访问）。同一道题可能出现在多个训练日/专题中（训练计划刻意安排的重复），因此表格条目数多于唯一题号数；文末统计按唯一题号计：LeetCode 202、Codeforces 98、AtCoder 31、洛谷 20，合计 351 道。
一、寒假 LeetCode（主题：枚举、模拟，44 条）¶
寒假题单只有一个主题（枚举、模拟），但选题覆盖栈、链表、二叉树、DP、二分等多个考点，作为综合热身。
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 1534 | Count Good Triplets | Easy | - [ ] |
| 2 | LC 2212 | Maximum Points in an Archery Competition | Medium | - [ ] |
| 3 | LC 682 | Baseball Game | Easy | - [ ] |
| 4 | LC 1222 | Queens That Can Attack the King | Medium | - [ ] |
| 5 | LC 205 | Isomorphic Strings | Easy | - [ ] |
| 6 | LC 208 | Implement Trie (Prefix Tree) | Medium | - [ ] |
| 7 | LC 160 | Intersection of Two Linked Lists | Easy | - [ ] |
| 8 | LC 187 | Repeated DNA Sequences | Medium | - [ ] |
| 9 | LC 20 | Valid Parentheses | Easy | - [ ] |
| 10 | LC 84 | Largest Rectangle in Histogram | Hard | - [ ] |
| 11 | LC 15 | 3Sum | Medium | - [ ] |
| 12 | LC 169 | Majority Element | Easy | - [ ] |
| 13 | LC 179 | Largest Number | Medium | - [ ] |
| 14 | LC 75 | Sort Colors | Medium | - [ ] |
| 15 | LC 94 | Binary Tree Inorder Traversal | Easy | - [ ] |
| 16 | LC 114 | Flatten Binary Tree to Linked List | Medium | - [ ] |
| 17 | LC 543 | Diameter of Binary Tree | Easy | - [ ] |
| 18 | LC 124 | Binary Tree Maximum Path Sum | Hard | - [ ] |
| 19 | LC 200 | Number of Islands | Medium | - [ ] |
| 20 | LC 322 | Coin Change | Medium | - [ ] |
| 21 | LC 21 | Merge Two Sorted Lists | Easy | - [ ] |
| 22 | LC 390 | Elimination Game | Medium | - [ ] |
| 23 | LC 1823 | Find the Winner of the Circular Game | Medium | - [ ] |
| 24 | LC 394 | Decode String | Medium | - [ ] |
| 25 | LC 257 | Binary Tree Paths | Easy | - [ ] |
| 26 | LC 494 | Target Sum | Medium | - [ ] |
| 27 | LC 78 | Subsets | Medium | - [ ] |
| 28 | LC 473 | Matchsticks to Square | Medium | - [ ] |
| 29 | LC 374 | Guess Number Higher or Lower | Easy | - [ ] |
| 30 | LC 300 | Longest Increasing Subsequence | Medium | - [ ] |
| 31 | LC 349 | Intersection of Two Arrays | Easy | - [ ] |
| 32 | LC 363 | Max Sum of Rectangle No Larger Than K | Medium | - [ ] |
| 33 | LC 190 | Reverse Bits | Easy | - [ ] |
| 34 | LC 240 | Search a 2D Matrix II | Medium | - [ ] |
| 35 | LC 191 | Number of 1 Bits | Easy | - [ ] |
| 36 | LC 4 | Median of Two Sorted Arrays | Hard | - [ ] |
| 37 | LC 455 | Assign Cookies | Easy | - [ ] |
| 38 | LC 11 | Container With Most Water | Medium | - [ ] |
| 39 | LC 70 | Climbing Stairs | Easy | - [ ] |
| 40 | LC 64 | Minimum Path Sum | Medium | - [ ] |
| 41 | LC 121 | Best Time to Buy and Sell Stock | Easy | - [ ] |
| 42 | LC 198 | House Robber | Medium | - [ ] |
| 43 | LC 338 | Counting Bits | Easy | - [ ] |
| 44 | LC 322 | Coin Change | Medium | - [ ] |
关于重复条目
原题单中 LC 322 Coin Change 出现两次（第 20 条与第 44 条），此处按原样保留；按唯一题号统计时只计一次。
二、暑假 LeetCode（周1-周6 + 扩展1-6）¶
重要专题（周1-周6）¶
周1：DFS & BFS（15 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 938 | Range Sum of BST | Easy | - [ ] |
| 2 | LC 399 | Evaluate Division | Medium | - [ ] |
| 3 | LC 126 | Word Ladder II | Hard | - [ ] |
| 4 | LC 897 | Increasing Order Search Tree | Easy | - [ ] |
| 5 | LC 529 | Minesweeper | Medium | - [ ] |
| 6 | LC 127 | Word Ladder | Hard | - [ ] |
| 7 | LC 100 | Same Tree | Easy | - [ ] |
| 8 | LC 419 | Battleships in a Board | Medium | - [ ] |
| 9 | LC 301 | Remove Invalid Parentheses | Hard | - [ ] |
| 10 | LC 104 | Maximum Depth of Binary Tree | Easy | - [ ] |
| 11 | LC 997 | Find the Town Judge | Easy | - [ ] |
| 12 | LC 407 | Trapping Rain Water II | Hard | - [ ] |
| 13 | LC 101 | Symmetric Tree | Easy | - [ ] |
| 14 | LC 107 | Binary Tree Level Order Traversal II | Medium | - [ ] |
| 15 | LC 2616 | Minimize the Maximum Difference of Pairs | Medium | - [ ] |
周2：搜索 + 二分查找（15 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 733 | Flood Fill | Easy | - [ ] |
| 2 | LC 756 | Pyramid Transition Matrix | Medium | - [ ] |
| 3 | LC 4 | Median of Two Sorted Arrays | Hard | - [ ] |
| 4 | LC 1022 | Sum of Root To Leaf Binary Numbers | Easy | - [ ] |
| 5 | LC 1026 | Maximum Difference Between Node and Ancestor | Medium | - [ ] |
| 6 | LC 668 | Kth Smallest Number in Multiplication Table | Hard | - [ ] |
| 7 | LC 463 | Island Perimeter | Easy | - [ ] |
| 8 | LC 130 | Surrounded Regions | Medium | - [ ] |
| 9 | LC 410 | Split Array Largest Sum | Hard | - [ ] |
| 10 | LC 69 | Sqrt(x) | Easy | - [ ] |
| 11 | LC 378 | Kth Smallest Element in a Sorted Matrix | Medium | - [ ] |
| 12 | LC 753 | Cracking the Safe | Hard | - [ ] |
| 13 | LC 441 | Arranging Coins | Easy | - [ ] |
| 14 | LC 611 | Valid Triangle Number | Medium | - [ ] |
| 15 | LC 297 | Serialize and Deserialize Binary Tree | Hard | - [ ] |
周3：数据结构 heap & stack & hashmap（16 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 703 | Kth Largest Element in a Stream | Easy | - [ ] |
| 2 | LC 187 | Repeated DNA Sequences | Medium | - [ ] |
| 3 | LC 23 | Merge k Sorted Lists | Hard | - [ ] |
| 4 | LC 1046 | Last Stone Weight | Easy | - [ ] |
| 5 | LC 973 | K Closest Points to Origin | Medium | - [ ] |
| 6 | LC 857 | Minimum Cost to Hire K Workers | Hard | - [ ] |
| 7 | LC 1047 | Remove All Adjacent Duplicates In String | Easy | - [ ] |
| 8 | LC 146 | LRU Cache | Medium | - [ ] |
| 9 | LC 295 | Find Median from Data Stream | Hard | - [ ] |
| 10 | LC 682 | Baseball Game | Easy | - [ ] |
| 11 | LC 232 | Implement Queue using Stacks | Easy | - [ ] |
| 12 | LC 266 | Palindrome Permutation | Easy | - [ ] |
| 13 | LC 42 | Trapping Rain Water | Hard | - [ ] |
| 14 | LC 1 | Two Sum | Easy | - [ ] |
| 15 | LC 91 | Decode Ways | Medium | - [ ] |
| 16 | LC 224 | Basic Calculator | Hard | - [ ] |
周4：Backtracking（14 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 997 | Find the Town Judge | Easy | - [ ] |
| 2 | LC 17 | Letter Combinations of a Phone Number | Medium | - [ ] |
| 3 | LC 51 | N-Queens | Hard | - [ ] |
| 4 | LC 401 | Binary Watch | Easy | - [ ] |
| 5 | LC 473 | Matchsticks to Square | Medium | - [ ] |
| 6 | LC 301 | Remove Invalid Parentheses | Hard | - [ ] |
| 7 | LC 1863 | Sum of All Subset XOR Totals | Easy | - [ ] |
| 8 | LC 526 | Beautiful Arrangement | Medium | - [ ] |
| 9 | LC 1467 | Probability of a Two Boxes Having The Same Number of Distinct Balls | Hard | - [ ] |
| 10 | LC 1864 | Minimum Number of Swaps to Make the Binary String Alternating | Medium | - [ ] |
| 11 | LC 513 | Find Bottom Left Tree Value | Medium | - [ ] |
| 12 | LC 679 | 24 Game | Hard | - [ ] |
| 13 | LC 1700 | Number of Students Unable to Eat Lunch | Easy | - [ ] |
| 14 | LC 2065 | Maximum Path Quality of a Graph | Hard | - [ ] |
周5：动态规划（15 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 198 | House Robber | Easy | - [ ] |
| 2 | LC 845 | Longest Mountain in Array | Medium | - [ ] |
| 3 | LC 174 | Dungeon Game | Hard | - [ ] |
| 4 | LC 53 | Maximum Subarray | Medium | - [ ] |
| 5 | LC 213 | House Robber II | Medium | - [ ] |
| 6 | LC 188 | Best Time to Buy and Sell Stock IV | Hard | - [ ] |
| 7 | LC 5 | Longest Palindromic Substring | Easy | - [ ] |
| 8 | LC 516 | Longest Palindromic Subsequence | Medium | - [ ] |
| 9 | LC 233 | Number of Digit One | Hard | - [ ] |
| 10 | LC 2094 | Finding 3-Digit Even Numbers | Easy | - [ ] |
| 11 | LC 781 | Rabbits in Forest | Medium | - [ ] |
| 12 | LC 403 | Frog Jump | Hard | - [ ] |
| 13 | LC 401 | Binary Watch | Easy | - [ ] |
| 14 | LC 337 | House Robber III | Medium | - [ ] |
| 15 | LC 514 | Freedom Trail | Hard | - [ ] |
周6：贪心专题（16 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 1323 | Maximum 69 Number | Easy | - [ ] |
| 2 | LC 402 | Remove K Digits | Medium | - [ ] |
| 3 | LC 1659 | Maximize Grid Happiness | Hard | - [ ] |
| 4 | LC 2027 | Minimum Moves to Convert String | Easy | - [ ] |
| 5 | LC 347 | Top K Frequent Elements | Medium | - [ ] |
| 6 | LC 135 | Candy | Hard | - [ ] |
| 7 | LC 680 | Valid Palindrome II | Easy | - [ ] |
| 8 | LC 435 | Non-overlapping Intervals | Medium | - [ ] |
| 9 | LC 2366 | Minimum Replacements to Sort the Array | Hard | - [ ] |
| 10 | LC 2259 | Remove Digit From Number to Maximize Result | Easy | - [ ] |
| 11 | LC 1328 | Break a Palindrome | Medium | - [ ] |
| 12 | LC 1405 | Longest Happy String | Medium | - [ ] |
| 13 | LC 1330 | Reverse Subarray To Maximize Array Value | Hard | - [ ] |
| 14 | LC 344 | Reverse String | Easy | - [ ] |
| 15 | LC 93 | Restore IP Addresses | Medium | - [ ] |
| 16 | LC 1402 | Reducing Dishes | Hard | - [ ] |
扩展专题（扩展1-扩展6）¶
扩展1：模拟（15 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 566 | Reshape the Matrix | Easy | - [ ] |
| 2 | LC 289 | Game of Life | Medium | - [ ] |
| 3 | LC 68 | Text Justification | Hard | - [ ] |
| 4 | LC 415 | Add Strings | Easy | - [ ] |
| 5 | LC 592 | Fraction Addition and Subtraction | Medium | - [ ] |
| 6 | LC 2296 | Design a Text Editor | Hard | - [ ] |
| 7 | LC 1252 | Cells with Odd Values in a Matrix | Easy | - [ ] |
| 8 | LC 1324 | Print Words Vertically | Medium | - [ ] |
| 9 | LC 224 | Basic Calculator | Hard | - [ ] |
| 10 | LC 2717 | Semi-Ordered Permutation | Easy | - [ ] |
| 11 | LC 959 | Regions Cut By Slashes | Medium | - [ ] |
| 12 | LC 2056 | Number of Valid Move Combinations On Chessboard | Hard | - [ ] |
| 13 | LC 20 | Valid Parentheses | Easy | - [ ] |
| 14 | LC 22 | Generate Parentheses | Medium | - [ ] |
| 15 | LC 749 | Contain Virus | Hard | - [ ] |
扩展2：二叉树（16 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 110 | Balanced Binary Tree | Easy | - [ ] |
| 2 | LC 102 | Binary Tree Level Order Traversal | Medium | - [ ] |
| 3 | LC LCP 10 | (LeetCode LCP 题) | Hard | - [ ] |
| 4 | LC 257 | Binary Tree Paths | Easy | - [ ] |
| 5 | LC 230 | Kth Smallest Element in a BST | Medium | - [ ] |
| 6 | LC 285 | Inorder Successor in BST | Medium | - [ ] |
| 7 | LC 778 | Swim in Rising Water | Hard | - [ ] |
| 8 | LC 203 | Remove Linked List Elements | Easy | - [ ] |
| 9 | LC 814 | Binary Tree Pruning | Medium | - [ ] |
| 10 | LC 2402 | Meeting Rooms III | Hard | - [ ] |
| 11 | LC 617 | Merge Two Binary Trees | Easy | - [ ] |
| 12 | LC 222 | Count Complete Tree Nodes | Medium | - [ ] |
| 13 | LC 968 | Binary Tree Cameras | Hard | - [ ] |
| 14 | LC 226 | Invert Binary Tree | Easy | - [ ] |
| 15 | LC 236 | Lowest Common Ancestor of a Binary Tree | Medium | - [ ] |
| 16 | LC 732 | My Calendar III | Hard | - [ ] |
扩展3：双指针（15 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 88 | Merge Sorted Array | Easy | - [ ] |
| 2 | LC 406 | Queue Reconstruction by Height | Medium | - [ ] |
| 3 | LC 42 | Trapping Rain Water | Hard | - [ ] |
| 4 | LC 392 | Is Subsequence | Easy | - [ ] |
| 5 | LC 16 | 3Sum Closest | Medium | - [ ] |
| 6 | LC 1147 | Longest Chunked Palindrome Decomposition | Hard | - [ ] |
| 7 | LC 35 | Search Insert Position | Easy | - [ ] |
| 8 | LC 18 | 4Sum | Medium | - [ ] |
| 9 | LC 1793 | Maximum Score of a Good Subarray | Hard | - [ ] |
| 10 | LC 350 | Intersection of Two Arrays II | Easy | - [ ] |
| 11 | LC 611 | Valid Triangle Number | Medium | - [ ] |
| 12 | LC 2193 | Minimum Number of Moves to Make Palindrome | Hard | - [ ] |
| 13 | LC 326 | Power of Three | Easy | - [ ] |
| 14 | LC 491 | Non-decreasing Subsequences | Medium | - [ ] |
| 15 | LC 1755 | Closest Subsequence Sum | Hard | - [ ] |
扩展4：Sliding Window & 分治（15 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 219 | Contains Duplicate II | Easy | - [ ] |
| 2 | LC 220 | Contains Duplicate III | Hard | - [ ] |
| 3 | LC 2106 | Maximum Fruits Harvested After at Most K Steps | Hard | - [ ] |
| 4 | LC 643 | Maximum Average Subarray I | Easy | - [ ] |
| 5 | LC 713 | Subarray Product Less Than K | Medium | - [ ] |
| 6 | LC 480 | Sliding Window Median | Hard | - [ ] |
| 7 | LC 108 | Convert Sorted Array to Binary Search Tree | Easy | - [ ] |
| 8 | LC 109 | Convert Sorted List to Binary Search Tree | Medium | - [ ] |
| 9 | LC 4 | Median of Two Sorted Arrays | Hard | - [ ] |
| 10 | LC 219 | Contains Duplicate II | Easy | - [ ] |
| 11 | LC 215 | Kth Largest Element in an Array | Medium | - [ ] |
| 12 | LC 23 | Merge k Sorted Lists | Hard | - [ ] |
| 13 | LC 404 | Sum of Left Leaves | Easy | - [ ] |
| 14 | LC 279 | Perfect Squares | Medium | - [ ] |
| 15 | LC 493 | Reverse Pairs | Hard | - [ ] |
扩展5：二叉树 + 链表（16 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 206 | Reverse Linked List | Easy | - [ ] |
| 2 | LC 92 | Reverse Linked List II | Medium | - [ ] |
| 3 | LC 432 | All O`one Data Structure | Hard | - [ ] |
| 4 | LC 342 | Power of Four | Easy | - [ ] |
| 5 | LC 2 | Add Two Numbers | Medium | - [ ] |
| 6 | LC 460 | LFU Cache | Hard | - [ ] |
| 7 | LC 234 | Palindrome Linked List | Easy | - [ ] |
| 8 | LC 86 | Partition List | Medium | - [ ] |
| 9 | LC 1206 | Design Skiplist | Hard | - [ ] |
| 10 | LC 141 | Linked List Cycle | Easy | - [ ] |
| 11 | LC 876 | Middle of the Linked List | Easy | - [ ] |
| 12 | LC 61 | Rotate List | Medium | - [ ] |
| 13 | LC 剑指Offer II 078 | (剑指Offer 题) | Hard | - [ ] |
| 14 | LC 290 | Word Pattern | Easy | - [ ] |
| 15 | LC 109 | Convert Sorted List to Binary Search Tree | Medium | - [ ] |
| 16 | LC 1235 | Maximum Profit in Job Scheduling | Hard | - [ ] |
扩展6：记忆化搜索（动态规划）（15 题）¶
| # | 题号 | 题目名称 | 难度 | 状态 |
|---|---|---|---|---|
| 1 | LC 121 | Best Time to Buy and Sell Stock | Easy | - [ ] |
| 2 | LC 139 | Word Break | Medium | - [ ] |
| 3 | LC 42 | Trapping Rain Water | Hard | - [ ] |
| 4 | LC 70 | Climbing Stairs | Easy | - [ ] |
| 5 | LC 397 | Integer Replacement | Medium | - [ ] |
| 6 | LC 44 | Wildcard Matching | Hard | - [ ] |
| 7 | LC 392 | Is Subsequence | Easy | - [ ] |
| 8 | LC 698 | Partition to K Equal Sum Subsets | Medium | - [ ] |
| 9 | LC 72 | Edit Distance | Hard | - [ ] |
| 10 | LC 118 | Pascal's Triangle | Easy | - [ ] |
| 11 | LC 122 | Best Time to Buy and Sell Stock II | Medium | - [ ] |
| 12 | LC 913 | Cat and Mouse | Hard | - [ ] |
| 13 | LC 1021 | Remove Outermost Parentheses | Easy | - [ ] |
| 14 | LC 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium | - [ ] |
| 15 | LC 1728 | Cat and Mouse II | Hard | - [ ] |
三、ACM 暑假集训 Day1-13（Codeforces / AtCoder / 洛谷）¶
难度列中，CF 为官方 Rating，AtCoder/洛谷 为题单标注的参考难度；「—」表示题单未标注。
Day1：贪心与二分（15 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1919C | Grouping Increases | 1400 | 贪心、排序 | - [ ] |
| 2 | CF | 1989C | Two Movies | 1400 | 贪心 | - [ ] |
| 3 | CF | 1923C | Find B | 1400 | 贪心、构造 | - [ ] |
| 4 | CF | 2131E | Adjacent XOR | 1400 | 贪心 | - [ ] |
| 5 | CF | 1907D | Jumping Through Segments | 1400 | 二分答案 | - [ ] |
| 6 | CF | 1985F | Final Boss | 1500 | 二分、优先队列 | - [ ] |
| 7 | CF | 1971E | Find the Car | 1500 | 二分、数学 | - [ ] |
| 8 | CF | 2009E | Klee's SUPER DUPER LARGE Array!!! | 1400 | 二分、数学 | - [ ] |
| 9 | AT | abc342_d | Square Pair | 1447 | 贪心、计数 | - [ ] |
| 10 | AT | abc375_d | ABBC | 1482 | 贪心、前缀 | - [ ] |
| 11 | AT | abc350_d | New Friends | 1503 | 贪心、并查集 | - [ ] |
| 12 | 洛谷 | P9752 | 密码锁 | 1600 | 贪心、枚举 | - [ ] |
| 13 | 洛谷 | P7913 | 廊桥分配 | 1650 | 贪心、排序、前缀和 | - [ ] |
| 14 | 洛谷 | P7961 | 数列 | 1700 | 贪心、二进制 | - [ ] |
| 15 | 洛谷 | P7084 | 移球游戏 | 1800 | 二分、贪心 | - [ ] |
Day2：栈与队列（14 题）¶
Day2 第 1 题题名勘误
原题单将 CF 1793C 标注为 “Doremy's IQ”，经 Codeforces API 验证，1793C 实为 Dora and Search（真正的 “Doremy's IQ” 是 CF 1707A）。下表已按验证结果修正。
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1793C | Dora and Search | 1500 | 数据结构、贪心 | - [ ] |
| 2 | CF | 496D | Tennis Game | 1400 | 数据结构、二分 | - [ ] |
| 3 | CF | 1869B | 2D Traveling | 1400 | 数据结构、贪心 | - [ ] |
| 4 | CF | 1312E | Array Shrinking | 1400 | 数据结构、DP | - [ ] |
| 5 | CF | 1157E | Minimum Array | 1600 | 数据结构、贪心 | - [ ] |
| 6 | CF | 1148E | Earth Wind and Fire | 1600 | 数据结构、贪心 | - [ ] |
| 7 | CF | 268D | Wall Bars | 1300 | 数据结构、DP | - [ ] |
| 8 | CF | 1214E | Petya and Construction Set | 1700 | 数据结构、贪心 | - [ ] |
| 9 | CF | 1941E | Rudolf and k Bridges | 1600 | 数据结构、DP、单调队列 | - [ ] |
| 10 | AT | abc247_e | Max Min | — | 双指针、滑动窗口 | - [ ] |
| 11 | AT | arc158_b | Sum of Max Min | — | 单调栈、数学 | - [ ] |
| 12 | AT | arc145_b | AB Game | — | 数学、二分、贪心 | - [ ] |
| 13 | 洛谷 | P7913 | 廊桥分配 | — | 队列、贪心、优先队列 | - [ ] |
| 14 | 洛谷 | P8860 | Potions (Easy Version) | — | 优先队列、贪心 | - [ ] |
Day3：模拟赛1（5 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1919C | Grouping Increases | 1400 | 贪心、DP | - [ ] |
| 2 | CF | 977E | Cyclic Components | 1500 | 图论、DFS | - [ ] |
| 3 | CF | 510C | Fox And Names | 1600 | 图论、拓扑排序 | - [ ] |
| 4 | CF | 1144F | Graph Without Long Directed Paths | 1700 | 图论、二分图 | - [ ] |
| 5 | AT | dp_v | Subtree | 1800 | 树形DP、换根DP | - [ ] |
Day4：DP 基础（12 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 2121E | Sponsor of Your Problems | 1500 | DP、线性DP、数位DP | - [ ] |
| 2 | CF | 1969C | Minimizing the Sum | 1700 | DP、线性DP | - [ ] |
| 3 | CF | 2069C | Beautiful Sequence | 1500 | DP、线性DP、组合计数 | - [ ] |
| 4 | CF | 1984C2 | Magnitude (Hard Version) | 1700 | DP、线性DP | - [ ] |
| 5 | CF | 1954D | Colored Balls | 1800 | DP、背包DP | - [ ] |
| 6 | CF | 1974E | Money Buys Happiness | 1800 | DP、背包DP | - [ ] |
| 7 | CF | 2078D | Scammy Game Ad | 1800 | DP、背包DP | - [ ] |
| 8 | AT | dp_d | Knapsack 1 | — | DP、01背包 | - [ ] |
| 9 | AT | dp_e | Knapsack 2 | — | DP、01背包（价值优化） | - [ ] |
| 10 | AT | dp_f | LCS | — | DP、LCS | - [ ] |
| 11 | 洛谷 | P9868 | buying hay（买干草） | — | DP、完全背包 | - [ ] |
| 12 | 洛谷 | P2679 | 子串 | — | DP、线性DP | - [ ] |
Day5：DP 进阶（12 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1946C | Tree Cutting | 1600 | 树形DP | - [ ] |
| 2 | CF | 2070D | Tree Jumps | 1600 | 树形DP | - [ ] |
| 3 | CF | 1970C2 | Game on Tree (Medium) | 1700 | 树形DP、博弈 | - [ ] |
| 4 | CF | 2133D | Chicken Jockey | 1900 | 区间DP、贪心 | - [ ] |
| 5 | CF | 1990D | Grid Puzzle | 1800 | 状压DP | - [ ] |
| 6 | CF | 1912K | Kim's Quest | 1800 | 状压DP、组合数学 | - [ ] |
| 7 | CF | 2192D | Cost of Tree | 1800 | 树形DP | - [ ] |
| 8 | AT | dp_n | Slimes（区间合并） | — | 区间DP | - [ ] |
| 9 | AT | dp_u | Groups（集合DP） | — | 状压DP | - [ ] |
| 10 | AT | dp_r | Walk（矩阵快速幂） | — | 树形DP、矩阵快速幂 | - [ ] |
| 11 | 洛谷 | P1005 | 矩阵取数游戏 | — | 区间DP、高精度 | - [ ] |
| 12 | 洛谷 | P1352 | 没有上司的舞会 | — | 树形DP | - [ ] |
Day6：图论基础（11 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 2041D | Drunken Maze | 1700 | BFS、最短路 | - [ ] |
| 2 | CF | 2023B | Skipping | 1700 | 最短路、DP | - [ ] |
| 3 | CF | 1915G | Bicycles | 1800 | Dijkstra | - [ ] |
| 4 | CF | 2014E | Rendez-vous de Marian et Robin | 1800 | Dijkstra、多源最短路 | - [ ] |
| 5 | CF | 1975D | Paint the Tree | 1700 | BFS、树直径 | - [ ] |
| 6 | CF | 2060E | Graph Composition | 1500 | DFS、图遍历 | - [ ] |
| 7 | CF | 2027C | Add Zeros | 1500 | DFS、图建模 | - [ ] |
| 8 | AT | abc384_e | Takahashi is Slime 2 | 1600 | Dijkstra、BFS | - [ ] |
| 9 | AT | arc185_d | Random Walk on Tree | 1900 | DFS、树、期望 | - [ ] |
| 10 | 洛谷 | P1144 | 最短路计数 | 1600 | BFS、最短路计数 | - [ ] |
| 11 | 洛谷 | P9754 | [CSP-S 2023] 消消乐 | 1800 | DFS、搜索、剪枝 | - [ ] |
Day7：图论进阶（12 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1245D | Shichikuji and Power Grid | 1900 | MST、Kruskal | - [ ] |
| 2 | CF | 427C | Checkposts | 1700 | 强连通分量、Tarjan | - [ ] |
| 3 | CF | 1986F | Non-academic Problem | 1900 | 桥、Tarjan | - [ ] |
| 4 | CF | 770C | Online Courses In BSU | 1700 | 拓扑排序 | - [ ] |
| 5 | CF | 1931F | Chat Screenshots | 1700 | 拓扑排序 | - [ ] |
| 6 | CF | 1991D | Prime XOR Coloring | 1900 | 图染色、二分图 | - [ ] |
| 7 | CF | 1927F | Microcycle | 1900 | DSU、最小环 | - [ ] |
| 8 | AT | abc277_d | Takahashi's Solitaire | 1800 | DSU、连通分量 | - [ ] |
| 9 | AT | arc111_b | Reversible Cards | 1800 | 图论、DSU | - [ ] |
| 10 | AT | abc265_d | Iroha and Haiku | 1800 | 前缀和、二分 | - [ ] |
| 11 | 洛谷 | P2661 | 信息传递 | 1700 | 拓扑排序、DSU、最小环 | - [ ] |
| 12 | 洛谷 | P1347 | 排序 | 1600 | 拓扑排序、环检测 | - [ ] |
Day8：模拟赛2（5 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1996D | Fun | 1500 | 数学、组合数学 | - [ ] |
| 2 | CF | 2063C | Remove Exactly Two | 1600 | 图论、贪心 | - [ ] |
| 3 | AT | dp_l | Deque | 1700 | 博弈DP、区间DP | - [ ] |
| 4 | AT | dp_n | Slimes | 1800 | 区间DP | - [ ] |
| 5 | AT | abc184_f | Programming Contest | 1900 | Meet in the Middle | - [ ] |
Day9：数论与数学（12 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1920C | Partitioning the Array | 1600 | GCD、因数分解 | - [ ] |
| 2 | CF | 1957C | How Does the Rook Move? | 1600 | 组合数学、DP | - [ ] |
| 3 | CF | 1985G | D-Function | 1600 | 数论、组合数学 | - [ ] |
| 4 | CF | 2039D | Shohag Loves GCD | 1700 | GCD、构造 | - [ ] |
| 5 | CF | 2050F | Maximum modulo equality | 1700 | 数据结构、GCD | - [ ] |
| 6 | CF | 2065G | Skibidus and Capping | 1700 | 数论、素数 | - [ ] |
| 7 | CF | 1995C | Squaring | 1800 | 贪心、数论 | - [ ] |
| 8 | AT | abc240_d | Strange Balls | — | 栈、模运算 | - [ ] |
| 9 | AT | abc303_d | Shift vs. CapsLock | — | DP、贪心 | - [ ] |
| 10 | AT | abc286_c | Rotate and Palindrome | — | 枚举、回文 | - [ ] |
| 11 | 洛谷 | P1082 | [NOIP 2012] 同余方程 | — | 扩展欧几里得 | - [ ] |
| 12 | 洛谷 | P4777 | 【模板】扩展中国剩余定理 | — | EXCRT | - [ ] |
Day10：字符串（14 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1948D | Tandem Repeats? | 1700 | 哈希、字符串 | - [ ] |
| 2 | CF | 2010C2 | Message Transmission Error (hard version) | 1700 | 哈希、KMP | - [ ] |
| 3 | CF | 1979D | Fixing a Binary String | 1800 | 哈希、字符串 | - [ ] |
| 4 | CF | 2069D | Palindrome Shuffle | 1800 | 哈希、二分 | - [ ] |
| 5 | CF | 1968G1 | Division + LCP (easy version) | 1900 | 二分、哈希 | - [ ] |
| 6 | CF | 1902E | Collapsing Strings | 1900 | Trie、字符串 | - [ ] |
| 7 | CF | 1943B | Non-Palindromic Substring | 2000 | 哈希、数学 | - [ ] |
| 8 | CF | 1984D | "a" String Problem | 2000 | 哈希、字符串 | - [ ] |
| 9 | AT | abc346_f | String Shifting | 1900 | KMP、前缀函数 | - [ ] |
| 10 | AT | abc284_f | Yet Another String Game | 1800 | 哈希、前缀函数 | - [ ] |
| 11 | AT | abc287_f | Predilection | 1800 | Trie、DP | - [ ] |
| 12 | 洛谷 | P3375 | 【模板】KMP字符串匹配 | 1700 | KMP | - [ ] |
| 13 | 洛谷 | P3501 | [POI2010] ANT-Antisymmetry | 1900 | 哈希、回文 | - [ ] |
| 14 | 洛谷 | P2852 | [USACO06DEC] Milk Patterns G | 1800 | 后缀数组/哈希 | - [ ] |
Day11：高级数据结构（13 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | CF | 1971G | XOUR | 1700 | DSU、排序 | - [ ] |
| 2 | CF | 1968F | Equal XOR Segments | 1800 | 前缀异或、二分 | - [ ] |
| 3 | CF | 1985H1 | Maximize the Largest Component (Easy Version) | 1700 | DSU、图论 | - [ ] |
| 4 | CF | 1922D | Berserk Monsters | 1900 | DSU、链表 | - [ ] |
| 5 | CF | 1994D | Funny Game | 1900 | DSU、贪心 | - [ ] |
| 6 | CF | 2020D | Connect the Dots | 1800 | DSU、数论 | - [ ] |
| 7 | CF | 1932F | Feed Cats | 1900 | 数据结构、DP | - [ ] |
| 8 | CF | 2184E | Exquisite Array | 1800 | DSU、组合计数 | - [ ] |
| 9 | AT | library_practice_2_a | Union Find（并查集模板） | — | DSU | - [ ] |
| 10 | AT | DSL_2_H | Range Update Query | — | 线段树、懒标记 | - [ ] |
| 11 | AT | DSL_2_B | Range Sum Query | — | 树状数组、BIT | - [ ] |
| 12 | 洛谷 | P3870 | [TJOI2009] 开关 | — | 线段树、懒标记 | - [ ] |
| 13 | 洛谷 | P1955 | [NOI2015] 程序自动分析 | — | DSU、离散化 | - [ ] |
Day12：模拟赛3（5 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 |
|---|---|---|---|---|---|---|
| 1 | AT | abc311_d | Grid Ice Floor | 1600 | DFS、模拟 | - [ ] |
| 2 | CF | 1948D | Tandem Repeats? | 1700 | 字符串、双指针 | - [ ] |
| 3 | CF | 1324F | Maximum White Subtree | 1800 | DFS、DP、树 | - [ ] |
| 4 | AT | abc267_e | Erasing Vertices 2 | 1900 | 二分、贪心 | - [ ] |
| 5 | CF | 1486D | Max Median | 2100 | 二分、DP | - [ ] |
Day13：复盘与补缺（23 题）¶
| # | 平台 | 题号 | 题目名称 | 难度 | 考点 | 状态 | 备注 |
|---|---|---|---|---|---|---|---|
| 1 | CF | 2209D | Ghostfires | 1800 | 贪心、构造 | - [ ] | 选做 |
| 2 | CF | 2148F | Gravity Falls | 1800 | 贪心、排序 | - [ ] | 必做 |
| 3 | CF | 2172B | Buses | 1800 | 贪心、排序 | - [ ] | 选做 |
| 4 | CF | 2121F | Yamakasi | 1800 | 二分、双指针 | - [ ] | 必做 |
| 5 | CF | 2035D | Yet Another Real Number Problem | 1800 | 二分、数据结构 | - [ ] | 选做 |
| 6 | CF | 2110D | Fewer Batteries | 1700 | 二分、DFS、DP | - [ ] | 必做 |
| 7 | CF | 2144D | Price Tags | 1800 | DP、数学 | - [ ] | 必做 |
| 8 | CF | 2005C | Lazy Narek | 1800 | DP、字符串 | - [ ] | 选做 |
| 9 | CF | 1841C | Ranom Numbers | 1800 | DP、字符串 | - [ ] | 必做 |
| 10 | CF | 2112D | Reachability and Tree | 1700 | 构造、DFS、树 | - [ ] | 必做 |
| 11 | CF | 2127D | Root was Built by Love, Broken by Destiny | 1800 | 树、DFS、组合数学 | - [ ] | 选做 |
| 12 | CF | 2006B | Iris and the Tree | 1800 | DSU、DFS | - [ ] | 选做 |
| 13 | CF | 2203D | Divisibility Game | 1700 | 数论、博弈 | - [ ] | 必做 |
| 14 | CF | 2204E | Sum of Digits (and Again) | 1800 | 构造、数学 | - [ ] | 选做 |
| 15 | CF | 2150B | Grid Counting | 1700 | 组合数学 | - [ ] | 选做 |
| 16 | CF | 1709C | Recover an RBS | 1800 | 构造、贪心、字符串 | - [ ] | 必做 |
| 17 | CF | 1720D1 | Xor-Subsequence (easy version) | 1800 | 位运算、DP | - [ ] | 选做 |
| 18 | CF | 1635D | Infinite Set | 1800 | 位运算、DP、矩阵 | - [ ] | 必做 |
| 19 | CF | 2101B | Quartet Swapping | 1800 | 数据结构、分治 | - [ ] | 必做 |
| 20 | CF | 2025D | Attribute Checks | 1800 | 数据结构、DP | - [ ] | 选做 |
| 21 | CF | 2032D | Genokraken | 1800 | 构造、数据结构 | - [ ] | 选做 |
| 22 | CF | 1935C | Messenger in MAC | 2000 | 二分、DP、贪心 | - [ ] | 必做 |
| 23 | CF | 1930D1 | Sum over all Substrings (Easy Version) | 2100 | DP、字符串 | - [ ] | 必做 |
四、汇总统计¶
| 平台 | 唯一题号数 | 表格条目数 | 说明 |
|---|---|---|---|
| LeetCode | 202 | 227 | 寒假 + 暑假题单，跨专题重复只计一次，统计采用《题单汇总与验证》的 GraphQL API 验证数字；表格另含 LCP 10、剑指Offer II 078 等 API 未覆盖的特殊条目 |
| Codeforces | 98 | 100 | ACM 集训 Day1-13；1919C、1948D 各出现两次（Problemset API 验证） |
| AtCoder | 31 | 32 | 含 EDPC 与少量 AOJ 模板题；dp_n 出现两次 |
| 洛谷 | 20 | 21 | P7913 出现两次 |
| 总计 | 351 | 380 | 与首页统计一致 |