2025 AIME I 第 3 题

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

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

3.

一支棒球队的 99 名队员赛后去了冰淇淋店。每名队员都买了一个单球蛋筒,口味为巧克力、香草或草莓。每种口味至少有一名队员选择,并且选择巧克力的人数大于选择香草的人数,选择香草的人数又大于选择草莓的人数。令 NN 为满足这些条件的不同口味分配方式数。求 NN 除以 10001000 的余数。
The 99 members of a baseball team went to an ice-cream parlor after their game. Each player had a single scoop cone of chocolate, vanilla, or strawberry ice cream. At least one player chose each flavor, and the number of players who chose chocolate was greater than the number of players who chose vanilla, which was greater than the number of players who chose strawberry. Let NN be the number of different assignments of flavors to players that meet these conditions. Find the remainder when NN is divided by 1000.1000.
答案:16
知识点:多重集排列分类讨论
小提示:
先找出所有口味人数三元组:三个正整数严格递减且和为 99
First find every triple of flavor counts: strictly decreasing positive integers summing to 99
大提示:
对人数 (c,v,s)(c, v, s),把口味分给九名不同队员的方式数是 9!c! v! s!\frac{9!}{c!\,v!\,s!}
For counts (c,v,s),(c, v, s), the number of ways to assign flavors to the nine distinct players is 9!c! v! s!\frac{9!}{c!\,v!\,s!}
解答:
令 c>v>s≥1c \gt v \gt s \ge 1 分别为选择巧克力、香草和草莓的人数,并且 c+v+s=9c + v + s = 9。检查小的 ss 值,可得唯一可能为 (6,2,1)(6, 2, 1)、(5,3,1)(5, 3, 1),和 (4,3,2)(4, 3, 2)。
因为队员彼此不同,每个人数三元组贡献一个多项式系数: 9!6! 2! 1!=252,9!5! 3! 1!=504,9!4! 3! 2!=1260。 \begin{aligned} \frac{9!}{6!\,2!\,1!} &= 252, \\ \frac{9!}{5!\,3!\,1!} &= 504, \\ \frac{9!}{4!\,3!\,2!} &= 1260 \end{aligned}\text{。} 因此 N=252+504+1260=2016N = 252 + 504 + 1260 = 2016,除以 10001000 的余数为 1616。
Let c>v>s≥1c \gt v \gt s \ge 1 be the numbers of players choosing chocolate, vanilla, and strawberry, with c+v+s=9.c + v + s = 9. Checking small values of ss shows the only possibilities are (6,2,1),(6, 2, 1), (5,3,1),(5, 3, 1), and (4,3,2).(4, 3, 2).
Since the players are distinct, each triple of counts contributes a multinomial coefficient: 9!6! 2! 1!=252,9!5! 3! 1!=504,9!4! 3! 2!=1260. \begin{aligned} \frac{9!}{6!\,2!\,1!} &= 252, \\ \frac{9!}{5!\,3!\,1!} &= 504, \\ \frac{9!}{4!\,3!\,2!} &= 1260. \end{aligned} Thus N=252+504+1260=2016,N = 252 + 504 + 1260 = 2016, and the remainder modulo 10001000 is 16.16.
LIVE by Po-Shen Loh
LIVE项目

LIVE直播课程

Self-Paced录播课程

启明星Star计划

奖学金项目

关于我们

罗博深是谁?

邮件联系

订阅英文简报

加入我们

申请明星导师

For a more Thought Full world.

© 2026 Expii, Inc.