| Problem ID | Title | 分类 | AC | Submit | 正确率 | |
| Problem A | 查找最大元素 | 字符串 | 7 | 10 | ||
| Problem B | 【数组的距离】 | 二分排序 | 6 | 9 | ||
| Problem C | 【明明的随机数】 | 8 | 16 | |||
| Problem D | 数列有序 | 8 | 12 | |||
| Problem E | 数字统计 | 递推动态规划 | 6 | |||
| Problem F | 砝码问题(weight) | 动态规划搜索 | 3 | 14 | ||
| Problem G | 八皇后问题 | 递归博弈 | 5 | 5 | ||
| Problem H | 阶乘之和 | 贪心搜索 | 8 | 15 | ||
| Problem I | 解密QQ号 | 队列数据结构 | 1 | 3 | ||
| Problem J | 括号匹配 | 数据结构栈 | 3 | 10 | ||
| Problem K | 再解炸弹人 | 搜索 | 1 | 1 | ||
| Problem L | 宝岛探险 | 图论搜索搜索 | 1 | 8 | ||
| Problem M | 火柴棒等式 | 搜索 | 1 | 1 | ||
| Problem N | 解救小哈 | 图论搜索 | 1 | |||
| Problem O | 拦截导弹 | 动态规划 | 1 | 3 | ||
| Problem P | 最小转机 | 图论 | 1 | 1 | ||
| Problem Q | 喜羊羊与灰太狼 | |||||
| Problem R | 口袋的天空(Kruscal) | 图论并查集 | 9 | |||
| Problem S | 最优找零 | 动态规划 | 2 | 3 | ||
| Problem T | 不要11 | 动态规划 | 1 | 1 | ||
| Problem U | 算法7-9：最小生成树 | 图论最小生成树 | 1 | 1 |