Cody

# Problem 9. Who Has the Most Change?

Solution 2412999

Submitted on 29 May 2020
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   Fail
a = [1 2 1 15]; b = 1; assert(isequal(most_change(a),b))

b = 0.2500 0.1000 0.0500 0.0100 z = 0.6500 c = 0.6500 d = 1 y = 1

Assertion failed.

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

b = 0.2500 0.1000 0.0500 0.0100 z = 0.6500 1.1400 c = 1.1400 d = 2 y = 2

Assertion failed.

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

b = 0.2500 0.1000 0.0500 0.0100 z = 2.6500 4.0200 5.4400 c = 5.4400 d = 3 y = 3

Assertion failed.

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

b = 0.2500 0.1000 0.0500 0.0100 z = 0.2500 0.2400 c = 0.2500 d = 1 y = 1

Assertion failed.

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

b = 0.2500 0.1000 0.0500 0.0100 z = 0.2100 0.2600 c = 0.2600 d = 2 y = 2

Assertion failed.

6   Fail
% 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.

b = 0.2500 0.1000 0.0500 0.0100 z = 0.1000 0.0500 c = 0.1000 d = 1 y = 1

Assertion failed.

7   Fail
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))

b = 0.2500 0.1000 0.0500 0.0100 z = 0.6600 0.5100 0.4600 0.4200 1.0000 c = 1 d = 5 y = 5

Assertion failed.