2022 AMC 12A 第 19 题

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

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

19.

假设 1313 张编号为 11,22,33,…\ldots,1313 的卡片排成一行。任务是按数字递增顺序拿起它们,并反复从左到右扫描。在下面的例子中,第一次扫描拿起卡片 11,22,33,第二次扫描拿起 44 和 55,第三次扫描拿起 66,第四次扫描拿起 77,88,99,1010,第五次扫描拿起 1111,1212,1313。在 13!13! 种卡片排列中,有多少种会使这 1313 张卡片恰好在两次扫描中被拿起?
Suppose that 1313 cards numbered 1,1, 2,2, 3,3, …,\ldots, 1313 are arranged in a row. The task is to pick them up in numerically increasing order, working repeatedly from left to right. In the example below, cards 1,1, 2,2, 33 are picked up on the first pass, 44 and 55 on the second pass, 66 on the third pass, 7,7, 8,8, 9,9, 1010 on the fourth pass, and 11,11, 12,12, 1313 on the fifth pass. For how many of the 13!13! possible orderings of the cards will the 1313 cards be picked up in exactly two passes?
40824082
40954095
40964096
81788178
81918191
答案:D
知识点:排列找规律
小提示:
当下一个要拿的数位于前一个数的左边时,就必须开始新一轮扫描
A new pass begins exactly when the next number to pick up lies to the left of the previous one
大提示:
两次扫描意味着位置序列 pos(1),…,pos(13)\text{pos}(1),\ldots,\text{pos}(13) 恰好有一个下降
Two passes means the sequence of positions pos(1),…,pos(13)\text{pos}(1),\ldots,\text{pos}(13) has exactly one descent
解答:
设 pos(k)\text{pos}(k) 为卡片 kk 的位置。正好在 pos(k+1)<pos(k)\text{pos}(k+1)\lt\text{pos}(k) 时需要开始新一轮扫描,因此扫描次数等于序列 pos(1),pos(2),…,pos(13)\text{pos}(1),\text{pos}(2),\ldots,\text{pos}(13) 的下降数加一。
要构造至多有一个下降的排列,只需选出排在可能的下降之前的那些元素,并把两块都按递增顺序写出。这样的子集共有 2132^{13} 个。其中 1414 个初始段 ∅,{1},…,{1,…,13}\varnothing,\{1\},\ldots,\{1,\ldots,13\} 不产生下降;其余每个子集都恰好给出一个含一个下降的排列。因此总数为 213−14=81782^{13}-14=8178。
因此,正确答案是 D。
Let pos(k)\text{pos}(k) be the position of card k.k. A fresh pass is needed exactly when pos(k+1)<pos(k),\text{pos}(k+1)\lt\text{pos}(k), so the number of passes is one more than the number of descents in the sequence pos(1),pos(2),…,pos(13).\text{pos}(1),\text{pos}(2),\ldots,\text{pos}(13).
To build a permutation with at most one descent, choose the entries before the possible descent and write both chosen blocks in increasing order. There are 2132^{13} subsets. The 1414 initial segments ∅,{1},…,{1,…,13}\varnothing,\{1\},\ldots,\{1,\ldots,13\} produce no descent; every other subset produces a unique permutation with one descent. Hence the count is 213−14=8178.2^{13}-14=8178.
Thus, the correct answer is D.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.