Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
a = [1 2 1 15];
b = 1;
assert(isequal(most_change(a),b))
a =
0.6000
b =
1
|
2 | Pass |
%%
a = [ 1 2 1 15;
0 8 5 9];
b = 2;
assert(isequal(most_change(a),b))
a =
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))
a =
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))
a =
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))
a =
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.
a =
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))
a =
0.6600 0.4600 0.5100 0.4200 1.0000
b =
5
|
Given an unsigned integer x, find the largest y by rearranging the bits in x
780 Solvers
Find the largest value in the 3D matrix
1056 Solvers
Determine Whether an array is empty
646 Solvers
281 Solvers
511 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!