Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a = [1 2 1 15];
b = 1;
assert(isequal(most_change(a),b))
r =
1 2 1 15
t =
0.6000
b =
1
|
2 | Pass |
a = [ 1 2 1 15;
0 8 5 9];
b = 2;
assert(isequal(most_change(a),b))
r =
1 2 1 15
t =
0.6000
b =
1
r =
0 8 5 9
t =
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))
r =
1 22 1 15
t =
1.6000
b =
1
r =
12 3 13 7
t =
4.5200
b =
2
r =
10 8 23 99
t =
6.1900
b =
3
|
4 | Pass |
a = [ 1 0 0 0; 0 0 0 24];
b = 1;
assert(isequal(most_change(a),b))
r =
1 0 0 0
t =
0.2500
b =
1
r =
0 0 0 24
t =
0.2400
|
5 | Pass |
a = [ 0 1 2 1; 0 2 1 1];
c = 1;
assert(isequal(most_change(a),c))
r =
0 1 2 1
t =
0.2600
b =
1
r =
0 2 1 1
t =
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.
r =
0 1 0 0
t =
0.0500
b =
1
r =
0 0 1 0
t =
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))
r =
2 1 1 1
t =
0.6600
b =
1
r =
1 2 1 1
t =
0.4600
r =
1 1 2 1
t =
0.5100
r =
1 1 1 2
t =
0.4200
r =
4 0 0 0
t =
1
b =
5
|
1047 Solvers
Cell Counting: How Many Draws?
254 Solvers
247 Solvers
395 Solvers
481 Solvers