Cody

# Problem 9. Who Has the Most Change?

Solution 45084

Submitted on 18 Feb 2012 by Franck Dernoncourt
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))

UScoins = Columns 1 through 3 0.250000000000000 0.050000000000000 0.100000000000000 Column 4 0.010000000000000 b = 1

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

UScoins = Columns 1 through 3 0.250000000000000 0.050000000000000 0.100000000000000 Column 4 0.010000000000000 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))

UScoins = Columns 1 through 3 0.250000000000000 0.050000000000000 0.100000000000000 Column 4 0.010000000000000 b = 3

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

UScoins = Columns 1 through 3 0.250000000000000 0.050000000000000 0.100000000000000 Column 4 0.010000000000000 b = 1

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

UScoins = Columns 1 through 3 0.250000000000000 0.050000000000000 0.100000000000000 Column 4 0.010000000000000 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.

UScoins = Columns 1 through 3 0.250000000000000 0.050000000000000 0.100000000000000 Column 4 0.010000000000000 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))

UScoins = Columns 1 through 3 0.250000000000000 0.050000000000000 0.100000000000000 Column 4 0.010000000000000 b = 5

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!