Input: X = 40, Y = [40 20 10 4]
Output: Z = [1 0 0 0; 0 2 0 0; 0 1 2 0; 0 1 1 3; 0 1 0 5; 0 0 4 0; 0 0 3 3; 0 0 2 5; 0 0 1 8; 0 0 0 10]
Description:
- Z(1,:)*Y' >=40; (40*1+0+0+0)=40
- Z(4,:)*Y' >=40; (0+20*1+10*1+4*3)>40 (but minimum), and so on...
- Z should not contain any fraction.
- Z should contain all possible combinations.
- Input Y is always sorted
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers20
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15815 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
780 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
602 Solvers
-
303 Solvers
-
Divide elements by sum of elements
145 Solvers
More from this Author3
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
please clarify the problem statement, in particular the "but minimum" bit seems somewhat puzzling...