| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 2127 | T1203 扩号匹配问题 | 0 / 0 | (None) | |
| 2128 | T1204 爬楼梯 | 3 / 4 | 10 | |
| 2130 | T1207 求最大公约数(模板) | 1 / 1 | 10 | |
| 2131 | T1208 2的幂次方表示 | 1 / 1 | 10 | |
| 2133 | T1210 因子分解 | 0 / 0 | (None) | |
| 2134 | T1211 判断元素是否存在 | 0 / 0 | (None) | |
| 2135 | T1212 LETTERS | 1 / 1 | 10 | |
| 2136 | T1213 八皇后问题 | 1 / 1 | 10 | |
| 2137 | T1214 八皇后 | 0 / 0 | (None) | |
| 2140 | T1217 棋盘问题 | 0 / 1 | 10 | |
| 2141 | T1218 取石子游戏 | 1 / 2 | 10 | |
| 2143 | T1220 单词接龙 | 0 / 0 | (None) | |
| 2144 | T1221 分成互质组 | 0 / 0 | (None) | |
| 2145 | T1223 An Easy Problem | 0 / 0 | (None) | |
| 2146 | T1224 最大子矩阵 | 1 / 1 | 10 | |
| 2148 | T1226 装箱问题 | 0 / 0 | (None) | |
| 2149 | T1227 Ride to Office | 0 / 0 | (None) | |
| 2150 | T1228 书架 | 0 / 0 | (None) | |
| 2154 | T1232 Crossing River | 0 / 0 | (None) | |
| 2164 | T1242 网线主管 | 0 / 0 | (None) | |
| 2165 | T1243 月度开销 | 0 / 0 | (None) | |
| 2167 | T1245 不重复地输出数 | 1 / 1 | 10 | |
| 2168 | T1246 膨胀的木棍 | 0 / 0 | (None) | |
| 2170 | T1248 Dungeon Master | 0 / 0 | (None) | |
| 2175 | T1253 抓住那头牛 | 1 / 1 | 10 | |
| 2178 | T1256 献给阿尔吉侬的花束 | 0 / 0 | (None) | |
| 2182 | T1260 【例9.4】拦截导弹(Noip1999) | 0 / 0 | (None) | |
| 2183 | T1261 【例9.5】城市交通网络 | 0 / 1 | 10 | |
| 2185 | T1263 友好城市 | 0 / 0 | (None) | |
| 2188 | T1266 【例9.10】机器分配 | 0 / 0 | (None) | |
| 2196 | T1274 合并石子(区间dp模板) | 1 / 1 | 10 | |
| 2197 | T1275 乘积最大 | 0 / 0 | (None) | |
| 2199 | T1277 【例9.21】方格取数 | 0 / 0 | (None) | |
| 2200 | T1278 复制书稿2 | 0 / 0 | (None) | |
| 2201 | T1279 橱窗布置(flower) | 0 / 0 | (None) | |
| 2259 | T1287 最低通行费 | 11 / 37 | 6 | |
| 2260 | T1288 三角形最佳路径问题 | 0 / 0 | (None) | |
| 2261 | T1289 拦截导弹 | 0 / 0 | (None) | |
| 2265 | T1293 买书 | 0 / 0 | (None) | |
| 2266 | T1294 Charm Bracelet | 0 / 0 | (None) | |
| 2268 | T1296 开餐馆 | 0 / 0 | (None) | |
| 2271 | T1299 糖果 | 0 / 0 | (None) | |
| 2272 | T1300 鸡蛋的硬度 | 0 / 0 | (None) | |
| 2275 | T1301 大盗阿福 | 1 / 2 | 10 | |
| 2276 | T1302 股票买卖 | 0 / 0 | (None) | |
| 2277 | T1303 鸣人的影分身 | 0 / 0 | (None) | |
| 2278 | T1305 Maximum sum | 0 / 0 | (None) | |
| 2306 | T1309 【例1.6】回文数(Noip1999) | 1 / 5 | 10 | |
| 2281 | T1323 【例6.5】活动选择 | 1 / 1 | 10 | |
| 2282 | T1325 循环比赛日程表 | 0 / 0 | (None) | |
| 2287 | T1326 快速幂(模板) | 4 / 8 | 10 | |
| 2288 | T1327 【例7.6】黑白棋子的移动 | 1 / 9 | 10 | |
| 2290 | T1332 【例2-1】周末舞会 | 8 / 11 | 8 | |
| 2291 | T1334 围圈报数1 | 8 / 13 | 8 | |
| 2298 | T1341 【例题】一笔画问题 | 1 / 3 | 10 | |
| 2300 | T1342 【例4-1】最短路径问题 | 0 / 0 | (None) | |
| 2301 | T1343 【例4-2】牛的旅行 | 0 / 0 | (None) | |
| 2297 | T1346 亲戚(并查集模板1) | 1 / 8 | 10 | |
| 2296 | T1347 【例4-8】格子游戏 | 0 / 0 | (None) | |
| 2355 | T1349 最优布线问题(prim模板) | 0 / 0 | (None) | |
| 2356 | T1350 最短网络(agrinet) | 1 / 1 | 10 | |
| 2311 | T1355 字符串匹配问题(strs) | 0 / 0 | (None) | |
| 2314 | T1358 中缀表达式值(expr) | 1 / 4 | 10 | |
| 2320 | T1364 二叉树遍历(flist) | 1 / 1 | 10 | |
| 2322 | T1366 二叉树输出(btout) | 0 / 0 | (None) | |
| 2326 | T1370 最小函数值(minval) | 0 / 0 | (None) | |
| 2327 | T1371 看病 | 1 / 1 | 10 | |
| 2328 | T1372 小明的账单 | 0 / 0 | (None) | |
| 2329 | T1373 鱼塘钓鱼(fishing） | 1 / 1 | 10 | |
| 2331 | T1375 骑马修栅栏(fence) | 0 / 0 | (None) | |
| 2332 | T1376 信使(msner) | 0 / 0 | (None) | |
| 2333 | T1377 最优乘车(travel) | 0 / 0 | (None) | |
| 2336 | T1380 分糖果(candy) | 0 / 0 | (None) | |
| 2339 | T1383 刻录光盘(cdrom) | 0 / 0 | (None) | |
| 2340 | T1384 珍珠(bead) | 0 / 0 | (None) | |
| 2344 | T1388 家谱(gen) | 0 / 0 | (None) | |
| 2345 | T1389 亲戚(并查集模板2) | 0 / 1 | 10 | |
| 2346 | T1390 食物链【NOI2001】 | 0 / 0 | (None) | |
| 2348 | T1392 繁忙的都市(city) | 0 / 0 | (None) | |
| 2349 | T1393 联络员(liaison) | 0 / 0 | (None) | |
| 2350 | T1394 连接格点(grid) | 0 / 0 | (None) | |
| 2351 | T1395 烦人的幻灯片(slides) | 0 / 0 | (None) | |
| 2352 | T1396 病毒(virus) | 1 / 1 | 10 | |
| 2357 | T1402 Vigenère密码 | 0 / 0 | (None) | |
| 2368 | T1413 确定进制 | 0 / 0 | (None) | |
| 2370 | T1423 「一本通 1.1 例 2」种树 | 3 / 3 | 10 | |
| 2372 | T1425 「一本通 1.1 例 4」加工生产调度 | 0 / 0 | (None) | |
| 2374 | T1427 「一本通 1.1 练习 1」数列极差 | 0 / 0 | (None) | |
| 2375 | T1428 「一本通 1.1 练习 2」数列分段 | 0 / 0 | (None) | |
| 2376 | T1429 「一本通 1.1 练习 3」线段 | 0 / 0 | (None) | |
| 2377 | T1430 「一本通 1.1 练习 4」家庭作业 | 0 / 0 | (None) | |
| 2378 | T1431 「一本通 1.1 练习 5」钓鱼 | 0 / 0 | (None) | |
| 2381 | T1434 「一本通 1.2 例 2」Best Cow Fences | 0 / 0 | (None) | |
| 2382 | T1435 「一本通 1.2 例 3」曲线 | 0 / 0 | (None) | |
| 2383 | T1436 「一本通 1.2 练习 1」数列分段 II | 0 / 0 | (None) | |
| 2384 | T1437 「一本通 1.2 练习 2」扩散 | 0 / 0 | (None) | |
| 2385 | T1438 「一本通 1.2 练习 3」灯泡 | 0 / 0 | (None) | |
| 2386 | T1439 「一本通 1.2 练习 4」传送带 | 0 / 0 | (None) | |
| 2387 | T1440 「一本通 1.3 例 1」数的划分 | 0 / 0 | (None) | |
| 2390 | T1443 「一本通 1.3 例 4」Addition Chains | 0 / 0 | (None) |
