2026 AMC 10A 第 21 题

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

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

21.

Gerry 正在玩“三格游戏”。她的任务是把上图所示的 3×33 \times 3 方格表划分成三个区域,每个区域由三个相连的方格组成。(如果三个方格中的每一个都与另外两个中的至少一个有公共边,就称这三个方格是相连的。)X 比 O 多的区域,每个得一分。下图是一个示例划分,它总共得一分。得分为两分或更多的划分就能赢得游戏。对于这个特定的方格表,在所有可能的划分中,能让 Gerry 获胜的划分占几分之几?
Gerry is playing the Triples Game. Her task is to partition the 3×33 \times 3 grid of squares shown at the top into three sections, each containing three adjoining squares. (Three squares are adjoining if each shares an edge with at least one of the other two.) One point will be awarded for each section containing more X’s than O’s. Shown below it is a sample partition that will earn one point in total. A partition that earns two or more points will win the game. What fraction of the possible partitions of this particular grid will result in a win for Gerry?
310\dfrac{3}{10}
13\dfrac{1}{3}
25\dfrac{2}{5}
49\dfrac{4}{9}
12\dfrac{1}{2}
答案:C
知识点:铺砖系统列举分类讨论
小提示:
只有 44 个方格是 X。获胜需要两个区域各含 22 个 X,所以第三个区域全是 O。
Only 44 squares hold X’s. A win needs two sections with 22 X’s each, so the third section is all O’s.
大提示:
只有底行和一个 L 形由三个 O 组成。分别检查包含它们的划分。
Only the bottom row and one L-shape consist of three O’s. Check the partitions that contain each.
解答:
每个区域要么是排成一条直线的三个方格,要么是 L 形。L 形可以放进一个 2×22 \times 2 的方块中,所以它最多覆盖方格表的一个角,而中间的一行或一列一个角也不覆盖。三个区域要覆盖全部四个角,所以其中一个区域是沿着边的一整行或一整列。
剩下的是一个 2×32 \times 3 的长方形,它有 33 种分法:分成两个直条,或用 22 种方法分成两个 L 形。四条边共给出 4×3=124 \times 3 = 12 种,但“三行”和“三列”这两种划分各被数了两次,所以共有 1010 种划分。
方格表中只有 44 个 X,而一个区域至少要有 22 个 X 才能得分。所以获胜的划分中有两个区域各含 22 个 X,第三个区域由三个 O 组成。由三个 O 组成的区域只有两个:底行,以及由中右、下中、下右三个方格组成的 L 形。
若取底行,上面两行可以分成两行(XOX 和 XXO)或两个 L 形(同样是 XOX 和 XXO),都能获胜;也可以分成 XXX 和 OXO,只得 11 分。若取这个 L 形,其余六个方格只能分成顶行加一个 L 形(XOX 和 XXO),或左列加一个 L 形(XXO 和 OXX),都能获胜。
所以共有 44 种划分能获胜,占全部 1010 种划分的 25\frac{2}{5}。
因此,正确答案是 C。
Each section is a straight line of three squares or an L-shape. An L-shape fits in a 2×22 \times 2 block, so it covers at most one corner of the grid, and a middle row or column covers none. The three sections cover all four corners, so one of them is a full row or column along the edge.
That leaves a 2×32 \times 3 rectangle, which splits in 33 ways: into two straight pieces, or into two L-shapes in 22 ways. Four edges give 4×3=12,4 \times 3 = 12, but the three-rows and three-columns partitions are each counted twice, so there are 1010 partitions.
The grid has only 44 X’s, and a section earns a point only with at least 22 of them. So a winning partition has two sections with 22 X’s each and a third section of three O’s. Only two sections consist of three O’s: the bottom row, and the L made of the middle-right, bottom-center, and bottom-right squares.
With the bottom row, the top two rows split as two rows (XOX and XXO) or as two L-shapes (XOX and XXO again), both wins, or as XXX and OXO, which earns only 11 point. With the L, the other six squares split only as the top row plus an L (XOX and XXO) or as the left column plus an L (XXO and OXX), both wins.
So 44 of the 1010 partitions win, a fraction of 25.\frac{2}{5}.
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 隐私政策