Cody

# Problem 9. Who Has the Most Change?

Solution 1287385

Submitted on 15 Oct 2017 by Alexis Marchesi
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 = [] t = 0 m = 1 n = 4 A = 0.6000 k = 1 t = 0.6000

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

A = [] t = 0 m = 2 n = 4 A = 0.6000 k = 1 t = 0.6000 A = 0.6000 0.9900 k = 2 t = 0.9900

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

A = [] t = 0 m = 3 n = 4 A = 1.6000 k = 1 t = 1.6000 A = 1.6000 4.5200 k = 2 t = 4.5200 A = 1.6000 4.5200 6.1900 k = 3 t = 6.1900

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

A = [] t = 0 m = 2 n = 4 A = 0.2500 k = 1 t = 0.2500 A = 0.2500 0.2400

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

A = [] t = 0 m = 2 n = 4 A = 0.2600 k = 1 t = 0.2600 A = 0.2600 0.2100

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 = [] t = 0 m = 2 n = 4 A = 0.0500 k = 1 t = 0.0500 A = 0.0500 0.1000 k = 2 t = 0.1000

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 = [] t = 0 m = 5 n = 4 A = 0.6600 k = 1 t = 0.6600 A = 0.6600 0.4600 A = 0.6600 0.4600 0.5100 A = 0.6600 0.4600 0.5100 0.4200 A = 0.6600 0.4600 0.5100 0.4200 1.0000 k = 5 t = 1