“排列与组合”题卡笑文［题］把ｎ＋１件奖品分给ｎ个优胜者，每人至少一件，则分配方法数为（Ａ）（Ｂ）ｎ（ｎ＋１）！（Ｃ）（ｎ＋１）！（Ｄ）ｎ！［分析］考虑把ｎ＋１件奖品先分成ｎ份，然后再分给ｎ个优胜者［主解］第一步，从ｎ＋１件奖品中任取两件，并成１份，... “Assortment and Combination” title card “Laughter” [question] When n+1 prizes are given to n winners, at least one each, the number of assignment methods is (A)(B)n(n+1)! (C)(n+1)! (D)n! [Analysis] Consider n+1 prizes are divided into n first, and then divided into n winners [main solution] the first step, from the n+1 prizes to take two, and into 1 copies,...