#5:
ONE HUNDRED COINS
In how many ways 100 gold coins can be divided into groups, so that the difference between any two groups is at most 2?
Note: Permutations are not considered as different.
Example: If the problem was asked for 6 coins, the answer would be 9:
(1,1,1,1,1,1), (1,1,1,1,2), (1,1,2,2), (1,1,1,3), (1,2,3), (2,2,2), (2,4), (3,3), (6).
在多少种方法可以将100个金币分组,使得任何两组之间的差异最多为2?
注意:不考虑排列的差异。
例如:如果问的是6个硬币,答案是9:
(1,1,1,1,1,1), (1,1,1,1,2), (1,1,2,2), (1,1,1,3), (1,2,3), (2,2,2), (2,4), (3,3), (6).
这题很简单吧?分析几个就看出规律了。 |