Cody

Solution 893499

Submitted on 23 May 2016 by Dennis Winston
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
a = [1 2 1 15]; b = 1; assert(isequal(most_change(a),b))

rows = 1 columns = 4 money = 60 m = 60 b = 1

2   Pass
a = [ 1 2 1 15; 0 8 5 9]; b = 2; assert(isequal(most_change(a),b))

rows = 2 columns = 4 money = 60 money = 60 99 m = 99 b = 2

3   Pass
a = [ 1 22 1 15; 12 3 13 7; 10 8 23 99]; b = 3; assert(isequal(most_change(a),b))

rows = 3 columns = 4 money = 160 money = 160 452 money = 160 452 619 m = 619 b = 3

4   Pass
a = [ 1 0 0 0; 0 0 0 24]; b = 1; assert(isequal(most_change(a),b))

rows = 2 columns = 4 money = 25 money = 25 24 m = 25 b = 1

5   Pass
a = [ 0 1 2 1; 0 2 1 1]; c = 1; assert(isequal(most_change(a),c))

rows = 2 columns = 4 money = 26 money = 26 21 m = 26 b = 1

6   Pass
% There is a lot of confusion about this problem. Watch this. a = [0 1 0 0; 0 0 1 0]; c = 2; assert(isequal(most_change(a),c)) % Now go back and read the problem description carefully.

rows = 2 columns = 4 money = 5 money = 5 10 m = 10 b = 2

7   Pass
a = [ 2 1 1 1; 1 2 1 1; 1 1 2 1; 1 1 1 2; 4 0 0 0]; c = 5; assert(isequal(most_change(a),c))

rows = 5 columns = 4 money = 66 money = 66 46 money = 66 46 51 money = 66 46 51 42 money = 66 46 51 42 100 m = 100 b = 5