I have a combination problem in which we have to find all possible ways we can arrange 'n' boxes in 's' stacks with a maximum of 'h' boxes in each stack.
The order of the boxes doesn't matter but the order of the stacks matter and the stacks can be empty. I'm trying to formulate it.
(h=2, s=4, n=3) The possible ways to arrange for the above variables are
Here is the format image for the above question
How to find the combinations for these types of problems. Thanks in advance. I appreciate the help.
