2026 AMC 10B 第 22 题

先试着解答 2026 AMC 10B 第 22 题,然后核对你的答案与精心整理的解答,解答来自 LIVE by Po-Shen Loh。你也可以参加完整限时模拟考试、查看全部 2026 AMC 10B 解答,或核对答案。

所有题目均经美国数学协会(MAA)官方合法授权使用。

22.

Belinda 在平面上沿一条完全位于正方形区域 0≤x≤40\le x\le4 且 0≤y≤40\le y\le4 内的路径行走。称她的路径为合格路径,当且仅当它满足以下所有条件。
• 每一步向上、向下或向右移动一个单位。
• 路径不重复经过任何顶点。
• 路径从 (a,0)(a,0) 出发,到 (b,0)(b,0) 结束,其中 aa 和 bb 是满足 a<ba\lt b 的整数,且路径只在这两点接触 xx 轴。
下图左上方的例子是合格路径,另外两条是不合格路径。
Belinda 一共可以走出多少条合格路径?
Belinda follows a path on the plane that is entirely contained within the square region 0≤x≤40\le x\le4 and 0≤y≤4.0\le y\le4. Call her path dignified if and only if all of the following conditions are satisfied.
• Each step is one unit up, down, or to the right.
• The path does not revisit any vertex.
• The path starts at (a,0)(a,0) and ends at (b,0),(b,0), where aa and bb are integers with a<b,a\lt b, and touches the xx-axis only at these two points.
The following figure shows some examples of dignified and not dignified paths.
How many dignified paths can Belinda follow?
174174
340340
448448
512512
970970
答案:C
知识点:格路乘法原理
小提示:
按水平距离 d=b−ad=b-a 分类计数
Count by the horizontal distance d=b−ad=b-a
大提示:
选定每一步向右移动时的高度,竖直部分就随之确定
Choose the height of each rightward step; the vertical parts are then forced
解答:
先固定向右移动的步数。每一步的高度都必须是 11、22、33 或 44,因为路径始终在正方形内,而且只有起点和终点位于 xx 轴上。
例如,向右移动两步,高度依次为 22 和 33,起点为 (1,0)(1,0)。路径必须先上升到高度 22,向右走,再上升到高度 33,向右走,最后下降到横轴。
一旦选定起点和各步的高度,竖直部分就确定了。在相邻的向右步之间,直接上升或下降到下一个高度即可。如果中途反向,就会重复经过某个顶点。每组高度都能给出一条合格路径:各步高度始终为正,而且向右移动之后不会再回到之前的列。
向右移动两步时,起点的 xx 坐标可以是 00、11 或 22,共有 33 个起点位置。每一步各有 44 种独立的高度选择,因此这种情况共有 3×42=483\times4^2=48 条路径。
一般地,设向右移动的步数为 d=b−ad=b-a。它可以是 11、22、33 或 44。起点的 xx 坐标可以是从 00 到 4−d4-d 的任意整数,因此有 5−d5-d 个起点位置。各步高度共有 4d4^d 种选择。
路径总数为 4×4+3×42+2×43+44=448。\begin{aligned}&4\times4+3\times4^2\\&\quad+2\times4^3+4^4\\&=448\text{。}\end{aligned}
因此,正确答案是 C。
Fix the number of rightward steps. Each must be at height 1,1, 2,2, 3,3, or 4,4, because the path stays in the square and touches the xx-axis only at its endpoints.
For example, take two rightward steps at heights 22 and 3,3, starting at (1,0).(1,0). The path must go up to height 2,2, right, up to height 3,3, right, then down to the axis.
Once the start and heights are chosen, the vertical parts are forced. Between rightward steps, go straight up or down to the next height. Reversing direction would revisit a vertex. Every choice of heights gives a valid path: the heights stay positive, and after moving right the path never returns to an earlier column.
With two rightward steps, the starting xx-coordinate can be 0,0, 1,1, or 2:2: there are 33 starting positions. Each step independently has 44 height choices, so this case contributes 3×42=483\times4^2=48 paths.
In general, let d=b−ad=b-a be the number of rightward steps. It can be 1,1, 2,2, 3,3, or 4.4. The starting xx-coordinate can be any integer from 00 through 4−d,4-d, giving 5−d5-d positions. There are 4d4^d choices for the heights.
The total number of paths is 4×4+3×42+2×43+44=448.\begin{aligned}&4\times4+3\times4^2\\&\quad+2\times4^3+4^4\\&=448.\end{aligned}
Thus, the correct answer is C.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.使用条款隐私政策COPPA 隐私政策