Given two integer N and R, the task is to calculate the number of ways to distribute N identical objects into R distinct groups such that no groups are left empty.
Input: N = 4, R = 2
No of objects in 1st group = 1, in second group = 3
No of objects in 1st group = 2, in second group = 2
No of objects in 1st group = 3, in second group = 1
Input: N = 5, R = 3
Approach: Idea is to use Multinomial theorem. Let us suppose that x1 objects are placed in the first group, x2 objects are placed in second group and xR objects are placed in the Rth group. It is given that,
x1 + x2 + x3 +…+ xR = N for all xi ≥ 1 for 1 ≤ i ≤ R
Now replace every xi with yi + 1 for all 1 ≤ i ≤ R. Now all the y variaables are greater than or equal to zero.
The equation becomes,
y1 + y2 + y3 + … + yR + R = N for all yi ≥ 0 for 1 ≤ i ≤ R
y1 + y2 + y3 + … + yR = N – R
It now reduces to that standard multinomial equation whose solution is (N – R) + R – 1CR – 1.
The solution of this equation is given by N – 1CR – 1.
Below is the implementation of the above approach:
Time Complexity: O(R)
- Number of ways of distributing N identical objects in R distinct groups
- Ways of dividing a group into two halves such that two elements are in different groups
- Number of ways to arrange K different objects taking N objects at a time
- Number of Groups of Sizes Two Or Three Divisible By 3
- Split N^2 numbers into N groups of equal sum
- Divide 1 to n into two groups with minimum sum difference
- Calculate Stirling numbers which represents the number of ways to arrange r objects around n different circles
- Minimize the cost of partitioning an array into K groups
- Minimum sum obtained from groups of four elements from the given array
- Print a number strictly less than a given number such that all its digits are distinct.
- Count number of ways to divide a number in 4 parts
- Find the number of ways to divide number into four parts such that a = c and b = d
- Distributing M items in a circle of size N starting from K-th position
- Number of ways to get a given sum with n number of m-faced dices
- Number of ways to choose a pair containing an even and an odd number from 1 to N
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.