Given four integers n, w, m and k where,
- m is the total number of men.
- w is the total number of women.
- n is the total number of people that need to be selected to form the team.
- k is the minimum number of men that have to be selected.
The task is to find the number of ways in which the team can be formed.
Input: m = 2, w = 2, n = 3, k = 1
There are 2 men, 2 women. We need to make a team of size 3 with at least one man and one woman. We can make the team in following ways.
m1 m2 w1
m1 w1 w2
m2 w1 w2
m1 m2 w2
Input: m = 7, w = 6, n = 5, k = 3
Input: m = 5, w = 6, n = 6, k = 3
Approach: Since, we have to take at least k men.
Totals ways = Ways when ‘k’ men are selected + Ways when ‘k+1’ men are selected + … + when ‘n’ men are selected
Taking the first example from above where out of 7 men and 6 women, total 5 people need to be selected with at least 3 men,
Number of ways = (7C3 x 6C2) + (7C4 x 6C1) + (7C5)
= 7 x 6 x 5 x 6 x 5 + (7C3 x 6C1) + (7C2)
= 525 + 7 x 6 x 5 x 6 + 7 x 6
= (525 + 210 + 21)
Below is the implementation of the above approach:
Further Optimization : The above code can be optimized using faster algorithms for binomial coefficient computation.
- Total ways of selecting a group of X men from N men with or without including a particular man
- Total ways of choosing X men and Y women from a total of M men and W women
- Ways to form a group from three groups with given constraints
- Ways of dividing a group into two halves such that two elements are in different groups
- Number of ways to make mobile lock pattern
- Number of ways to erase exactly one element in the Binary Array to make XOR zero
- Number of ways to divide string in sub-strings such to make them in lexicographically increasing sequence
- Ways to Remove Edges from a Complete Graph to make Odd Edges
- Minimum matches the team needs to win to qualify
- Predict the winner of the game on the basis of absolute difference of sum by selecting numbers
- Find sum of N-th group of Natural Numbers
- Nicomachus’s Theorem (Sum of k-th group of odd positive numbers)
- Minimize the sum of the squares of the sum of elements of each group the array is divided into
- Number Theory | Generators of finite cyclic group under addition
- Different ways to represent N as sum of K non-zero integers
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.