tricky order
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a = [1 2 1 15];
b = 1;
assert(isequal(most_change(a),b))
SUM =
0.6000
maxi =
0.6000
b =
1
|
2 | Pass |
a = [ 1 2 1 15;
0 8 5 9];
b = 2;
assert(isequal(most_change(a),b))
SUM =
0.6000
SUM =
0.6000 0.9900
maxi =
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))
SUM =
1.6000
SUM =
1.6000 4.5200
SUM =
1.6000 4.5200 6.1900
maxi =
6.1900
b =
3
|
4 | Pass |
a = [ 1 0 0 0; 0 0 0 24];
b = 1;
assert(isequal(most_change(a),b))
SUM =
0.2500
SUM =
0.2500 0.2400
maxi =
0.2500
b =
1
|
5 | Pass |
a = [ 0 1 2 1; 0 2 1 1];
c = 1;
assert(isequal(most_change(a),c))
SUM =
0.2600
SUM =
0.2600 0.2100
maxi =
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.
SUM =
0.0500
SUM =
0.0500 0.1000
maxi =
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))
SUM =
0.6600
SUM =
0.6600 0.4600
SUM =
0.6600 0.4600 0.5100
SUM =
0.6600 0.4600 0.5100 0.4200
SUM =
0.6600 0.4600 0.5100 0.4200 1.0000
maxi =
1
b =
5
|
Make the vector [1 2 3 4 5 6 7 8 9 10]
29480 Solvers
1313 Solvers
749 Solvers
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
199 Solvers
168 Solvers