Cody

# Problem 9. Who Has the Most Change?

Solution 206352

Submitted on 20 Feb 2013 by Marc Savoie
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))

a = 25 2 1 15 a = 25 10 1 15 a = 25 10 10 15 a = 60 a = 1 b = 1

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

a = 25 2 1 15 0 8 5 9 a = 25 10 1 15 0 40 5 9 a = 25 10 10 15 0 40 50 9 a = 60 99 a = 2 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))

a = 25 22 1 15 300 3 13 7 250 8 23 99 a = 25 110 1 15 300 15 13 7 250 40 23 99 a = 25 110 10 15 300 15 130 7 250 40 230 99 a = 160 452 619 a = 3 b = 3

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

a = 25 0 0 0 0 0 0 24 a = 25 0 0 0 0 0 0 24 a = 25 0 0 0 0 0 0 24 a = 25 24 a = 1 b = 1

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

a = 0 1 2 1 0 2 1 1 a = 0 5 2 1 0 10 1 1 a = 0 5 20 1 0 10 10 1 a = 26 21 a = 1 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.

a = 0 1 0 0 0 0 1 0 a = 0 5 0 0 0 0 1 0 a = 0 5 0 0 0 0 10 0 a = 5 10 a = 2 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))

a = 50 1 1 1 25 2 1 1 25 1 2 1 25 1 1 2 100 0 0 0 a = 50 5 1 1 25 10 1 1 25 5 2 1 25 5 1 2 100 0 0 0 a = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a = 66 46 51 42 100 a = 5 b = 5