Problem 1516. Put m balls into n boxes
I don't think you have a complete statement of the problem. Why, in the first example, are arrangements like 1 1 2 excluded? And you only accept the arrangements in a particular order. How do you define the order?
the data ascended by column,when the first column is the same, sort by the second column,...
Thanks - and I realize now that 1 1 2 is not excluded; I just wasn't looking carefully.
The best way to generate such a sequence is using depth-first search or recursion. By prohibiting the usage of IFs, all solutions are inefficient (because we can't cut the tree, and are forced to follow all branches).
For the 3 balls 2 boxes cases, shouldn't the following be part of the answer as well?
1 2 1
2 1 1
2 1 2
2 2 1
Why is 'if' banned, @Binbin Qi? Due to this (stupid, in my opinion) ban, I can not use diff as well. I have put up a temporary change in place, but I suggest you to please fix the problem asap.
And if you are putting up restrictions on the test suite, please mention it in the problem statement.
Also, your own solution and the reference solution do not work.
Solution CommentsShow comments
Problem Recent Solvers63
Find the two most distant points
Back to basics 11 - Max Integer
Remove entire row and column in the matrix containing the input values
Count consecutive 0's in between values of 1
More from this Author17
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!