https://rubatotree.github.io/blog/tags/%E9%A2%98%E8%A7%A3/Recent content in 题解 on Umbrella Coffeehttps://rubatotree.github.io/blog/images/og-default.pnghttps://rubatotree.github.io/blog/images/og-default.pngHugoen-usMon, 29 Jun 2026 00:00:00 +0800https://rubatotree.github.io/blog/posts/pku-tm-solutions/Mon, 29 Jun 2026 00:00:00 +0800https://rubatotree.github.io/blog/posts/pku-tm-solutions/<p>北京大学计算机学院推免夏令营机考为 ACM 赛制，时长 2 小时，每场共 8 题，题目可能是中文或英文，部分题目（主要是英文题）选自 OJ 中已有的题目。题目不按难度排序，整体难度在 CF Div4（大部分题）到 Div2 D（1~2题） 之间，能切 Div2 D 的同学可以放心考试。据说实际不爆零就能通过。</p> <p>有意向报考北大计算机学院研究生的同学可以提前准备刷题。</p> <h2 id="loc-1">题源整理</h2> <h3 id="loc-2">2025 <a href="http://bailian.openjudge.cn/tm2025cs/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">比赛（无数据）</span></span></a></h3> <p></p> <ul> <li><a href="http://bailian.openjudge.cn/practice/2992/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">A. Lab 杯</span></span></a></li> <li><a href="http://bailian.openjudge.cn/practice/2976/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">B. All in All</span></span></a></li> <li><a href="http://bailian.openjudge.cn/tm2025cs/C/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">C. 表达式求值</span></span></a> （无数据）</li> <li><a href="http://bailian.openjudge.cn/tm2025cs/D/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">D. 忍者道具</span></span></a> （无数据）</li> <li><a href="http://bailian.openjudge.cn/tm2025cs/E/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">E. 神奇的数列</span></span></a> （无数据）</li> <li><a href="http://bailian.openjudge.cn/practice/2994/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">F. 拼装模型</span></span></a></li> <li><a href="http://bailian.openjudge.cn/practice/2367/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">G. Genealogical Tree</span></span></a></li> <li><a href="http://bailian.openjudge.cn/tm2025cs/H/" target="_blank" rel="noopener noreferrer"><span style="color: #59a4ff;"><span style="text-decoration: underline">H. 怀表问题</span></span></a> （无数据）</li> </ul> <p></p>