Cody

# Problem 9. Who Has the Most Change?

Solution 2154884

Submitted on 9 Mar 2020 by Simon
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))

money = 0.2500 0.0500 0.1000 0.0100 total = 0.2500 0.1000 0.1000 0.1500 sum_total = 0.6000 dump = 0.6000 b = 1

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

money = 0.2500 0.0500 0.1000 0.0100 total = 0.2500 0.1000 0.1000 0.1500 0 0.4000 0.5000 0.0900 sum_total = 0.6000 0.9900 dump = 0.9900 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))

money = 0.2500 0.0500 0.1000 0.0100 total = 0.2500 1.1000 0.1000 0.1500 3.0000 0.1500 1.3000 0.0700 2.5000 0.4000 2.3000 0.9900 sum_total = 1.6000 4.5200 6.1900 dump = 6.1900 b = 3

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

money = 0.2500 0.0500 0.1000 0.0100 total = 0.2500 0 0 0 0 0 0 0.2400 sum_total = 0.2500 0.2400 dump = 0.2500 b = 1

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

money = 0.2500 0.0500 0.1000 0.0100 total = 0 0.0500 0.2000 0.0100 0 0.1000 0.1000 0.0100 sum_total = 0.2600 0.2100 dump = 0.2600 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.

money = 0.2500 0.0500 0.1000 0.0100 total = 0 0.0500 0 0 0 0 0.1000 0 sum_total = 0.0500 0.1000 dump = 0.1000 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))

money = 0.2500 0.0500 0.1000 0.0100 total = 0.5000 0.0500 0.1000 0.0100 0.2500 0.1000 0.1000 0.0100 0.2500 0.0500 0.2000 0.0100 0.2500 0.0500 0.1000 0.0200 1.0000 0 0 0 sum_total = 0.6600 0.4600 0.5100 0.4200 1.0000 dump = 1 b = 5

### Community Treasure Hunt

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

Start Hunting!