Cody

Solution 244143

Submitted on 14 May 2013 by Mohamed B.S.
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))

q = 0.2500 d = 0.1000 n = 0.0500 p = 0.0100 tch = [] tch = 0.6000 m = 0.6000 m = 0.6000 b = 1

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

q = 0.2500 d = 0.1000 n = 0.0500 p = 0.0100 tch = [] tch = 0.6000 tch = 0.6000 0.9900 m = 0.6000 m = 0.6000 0.9900 b = 1 m = 0.6000 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))

q = 0.2500 d = 0.1000 n = 0.0500 p = 0.0100 tch = [] tch = 1.6000 tch = 1.6000 4.5200 tch = 1.6000 4.5200 6.1900 m = 1.6000 m = 1.6000 4.5200 6.1900 b = 1 m = 1.6000 4.5200 6.1900 b = 3

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

q = 0.2500 d = 0.1000 n = 0.0500 p = 0.0100 tch = [] tch = 0.2500 tch = 0.2500 0.2400 m = 0.2500 m = 0.2500 0.2400 b = 1

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

q = 0.2500 d = 0.1000 n = 0.0500 p = 0.0100 tch = [] tch = 0.2600 tch = 0.2600 0.2100 m = 0.2600 m = 0.2600 0.2100 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.

q = 0.2500 d = 0.1000 n = 0.0500 p = 0.0100 tch = [] tch = 0.0500 tch = 0.0500 0.1000 m = 0.0500 m = 0.0500 0.1000 b = 1 m = 0.0500 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))

q = 0.2500 d = 0.1000 n = 0.0500 p = 0.0100 tch = [] tch = 0.6600 tch = 0.6600 0.4600 tch = 0.6600 0.4600 0.5100 tch = 0.6600 0.4600 0.5100 0.4200 tch = 0.6600 0.4600 0.5100 0.4200 1.0000 m = 0.6600 m = 0.6600 0.4600 0.5100 0.4200 1.0000 b = 1 m = 0.6600 0.4600 0.5100 0.4200 1.0000 b = 5