考点组合概率统计
基本计数原理
考什么 · What it tests
考「一共有多少种」的最底层功夫:分步用乘法、分类用加法,加上正着不好数就数反面(互补),有重叠就用容斥。
The most basic "how many ways" counting: multiply across steps, add across cases, count the complement when the direct count is hard, and use inclusion-exclusion when cases overlap.
需要先会 · Prerequisites
- 乘法与加法 / Multiplication and addition
- 分类讨论 / Casework
- 集合与 Venn 图入门 / Sets and basic Venn diagrams
常见套路 · Common moves
- 分步乘、分类加:一件事分几步完成就把每步的选择数相乘,分成几类互不相干就相加——先判断是「步」还是「类」,是一切计数的起点。Multiply steps, add cases: if a task is done in stages, multiply the choices at each stage; if it splits into disjoint cases, add them — deciding "stage" vs "case" is where all counting begins.
- 正难则反用互补:问「至少一个」很难数时,用总数减去「一个都没有」,常一步搞定。When the front door is hard, use the complement: for "at least one," subtract "none at all" from the total — often a one-step finish.
- 有重叠用容斥:两类有交集时 ,别把重叠部分数两遍。Overlap calls for inclusion-exclusion: when two sets intersect, — don't count the overlap twice.
易错点 · Common pitfalls
- 该乘的时候加、该加的时候乘:分步骤(先选上衣再选裤子)是乘法,出题人常用措辞诱你用错。Adding when you should multiply and vice versa: stages (pick a top, then pants) call for multiplication, and the wording is designed to mislead you.
- 「至少」类直接正面硬数,既漏情况又重复——看到「至少」先想互补。Counting "at least" head-on, both missing and repeating cases — when you see "at least," reach for the complement first.
真题
官方真题共 56 道2011 #8★2007 #4★2026 #10★★2024 #5★★2024 #8★★2023 #8★★2020 #7★★2018 #3★★2015 #10★★2011 #6★★2004 #5★★2004 #8★★2000 #8★★1999 #9★★1991 #9★★1986 #9★★2025 #15★★★2025 #16★★★2024 #14★★★2024 #19★★★2020 #16★★★2019 #11★★★2019 #19★★★2018 #19★★★2017 #13★★★2017 #15★★★2016 #17★★★2016 #18★★★2015 #13★★★2015 #15★★★2014 #16★★★2013 #22★★★2012 #16★★★2011 #19★★★2010 #20★★★2009 #16★★★2009 #22★★★2008 #11★★★2007 #13★★★2006 #20★★★2005 #14★★★2002 #19★★★2001 #14★★★1999 #11★★★1999 #15★★★1995 #23★★★1994 #11★★★1993 #15★★★1993 #22★★★1991 #23★★★1985 #15★★★2017 #24★★★★2005 #24★★★★2001 #24★★★★1994 #24★★★★1985 #24★★★★
变形生成中 · 练习包先用官方真题