问题如下图：
选项：
A. 
B. 
C. 
解释：
请问这题怎么不选labeling呢？
NO.PZ2018062016000078 问题如下 A gourmet will rank 12 shes of a famous restaurant from most licious to least licious. To finout the number of possible ranking ways, whiprinciple of counting mapte A.Permutation B.Labeling C.Multiplication rule A is correct. Consiring the shes will arrangefrom most licious to least licious, the orr of the shes is important. Permutation means rearranging all the members of a set into some sequenor orr, so the permutation formula shoulapte 12的阶乘 我觉得是
NO.PZ2018062016000078 问题如下 A gourmet will rank 12 shes of a famous restaurant from most licious to least licious. To finout the number of possible ranking ways, whiprinciple of counting mapte A.Permutation B.Labeling C.Multiplication rule A is correct. Consiring the shes will arrangefrom most licious to least licious, the orr of the shes is important. Permutation means rearranging all the members of a set into some sequenor orr, so the permutation formula shoulapte 麻烦老师贴一下讲义的位置
NO.PZ2018062016000078问题如下A gourmet will rank 12 shes of a famous restaurant from most licious to least licious. To finout the number of possible ranking ways, whiprinciple of counting mapte A.Permutation B.Labeling C.Multiplication rule A is correct. Consiring the shes will arrangefrom most licious to least licious, the orr of the shes is important. Permutation means rearranging all the members of a set into some sequenor orr, so the permutation formula shoulaptePermutation就是排列，比如12个盘子各个都不同，随意抽出来3个进行排序。由于盘子不同，所以被抽出来的三个盘子的顺序就会影响最后的结果，这种情况下就是排列问题，即12P3。可以直接按计算器得到答案。与排列问题对应的是组合问题，比如12个相同的盘子，随意抽3个排序，由于盘子都一样，所以抽出来的这三个无论怎么排都一样。这就是组合问题，即12C3，也可以直接按计算器。在二项分布的公式里会涉及到按计算器算组合。C的乘法法则可以理解为从上海到北京有两种方法，从北京到东京有三种方法，那么从上海到东京就有2×3=6种方法。以上这几种算法都不是重点内容，了解即可，加油这题A答案是计算器里的P，这题B的答案就是计算机里的C麻？能否详细说以下LABELING这个点
请问这题为什么是permutation呀？为什么不是factorial呀？
老师您好
