Cody

Solution 1439824

Submitted on 12 Feb 2018 by Edward Alborghetti
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))

r = 1 c = 4 a1 = 25 a1 = 25 10 a1 = 25 10 10 a1 = 25 10 10 15 change = 60 changemax = 60 b = 1

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

r = 2 c = 4 a1 = 25 0 a1 = 25 10 0 40 a1 = 25 10 10 0 40 50 a1 = 25 10 10 15 0 40 50 9 a1 = 25 10 10 15 0 40 50 9 a1 = 25 10 10 15 0 40 50 9 a1 = 25 10 10 15 0 40 50 9 a1 = 25 10 10 15 0 40 50 9 change = 60 changemax = 60 b = 1 change = 99 changemax = 99 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))

r = 3 c = 4 a1 = 25 300 250 a1 = 25 110 300 15 250 40 a1 = 25 110 10 300 15 130 250 40 230 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 a1 = 25 110 10 15 300 15 130 7 250 40 230 99 change = 160 changemax = 160 b = 1 change = 452 changemax = 452 b = 2 change = 619 changemax = 619 b = 3

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

r = 2 c = 4 a1 = 25 0 a1 = 25 0 0 0 a1 = 25 0 0 0 0 0 a1 = 25 0 0 0 0 0 0 24 a1 = 25 0 0 0 0 0 0 24 a1 = 25 0 0 0 0 0 0 24 a1 = 25 0 0 0 0 0 0 24 a1 = 25 0 0 0 0 0 0 24 change = 25 changemax = 25 b = 1 change = 24

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

r = 2 c = 4 a1 = 0 0 a1 = 0 5 0 10 a1 = 0 5 20 0 10 10 a1 = 0 5 20 1 0 10 10 1 a1 = 0 5 20 1 0 10 10 1 a1 = 0 5 20 1 0 10 10 1 a1 = 0 5 20 1 0 10 10 1 a1 = 0 5 20 1 0 10 10 1 change = 26 changemax = 26 b = 1 change = 21

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.

r = 2 c = 4 a1 = 0 0 a1 = 0 5 0 0 a1 = 0 5 0 0 0 10 a1 = 0 5 0 0 0 0 10 0 a1 = 0 5 0 0 0 0 10 0 a1 = 0 5 0 0 0 0 10 0 a1 = 0 5 0 0 0 0 10 0 a1 = 0 5 0 0 0 0 10 0 change = 5 changemax = 5 b = 1 change = 10 changemax = 10 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))

r = 5 c = 4 a1 = 50 25 25 25 100 a1 = 50 5 25 10 25 5 25 5 100 0 a1 = 50 5 10 25 10 10 25 5 20 25 5 10 100 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 a1 = 50 5 10 1 25 10 10 1 25 5 20 1 25 5 10 2 100 0 0 0 change = 66 changemax = 66 b = 1 change = 46 change = 51 change = 42 change = 100 changemax = 100 b = 5

Suggested Problems

More from this Author95