Cody

# Problem 9. Who Has the Most Change?

Solution 2141370

Submitted on 26 Feb 2020 by Cohen Tian
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))

coin_values = 0.2500 0.0500 0.1000 0.0100 all_money = 0.6000 max_value = 0.6000 row = 1 b = 1

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

coin_values = 0.2500 0.0500 0.1000 0.0100 all_money = 0.6000 0.9900 max_value = 0.9900 row = 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))

coin_values = 0.2500 0.0500 0.1000 0.0100 all_money = 1.6000 4.5200 6.1900 max_value = 6.1900 row = 3 b = 3

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

coin_values = 0.2500 0.0500 0.1000 0.0100 all_money = 0.2500 0.2400 max_value = 0.2500 row = 1 b = 1

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

coin_values = 0.2500 0.0500 0.1000 0.0100 all_money = 0.2600 0.2100 max_value = 0.2600 row = 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.

coin_values = 0.2500 0.0500 0.1000 0.0100 all_money = 0.0500 0.1000 max_value = 0.1000 row = 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))

coin_values = 0.2500 0.0500 0.1000 0.0100 all_money = 0.6600 0.4600 0.5100 0.4200 1.0000 max_value = 1 row = 5 b = 5