Partition Into Subsets
Try First, Check Solution later1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.
1. You are given a number n, representing the number of elements.Input Format
2. You are given a number k, representing the number of subsets.
3. You are required to print the number of ways in which these elements can be partitioned in k non-empty subsets.
For n = 4 and k = 3 total ways is 6
A number nOutput Format
A number k
A number representing the number of ways in which these elements can be partitioned in k non-empty subsets.Question Video
0 <= n <= 20Sample Input
0 <= k <= n
Asked in Companies