Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
a = 0;
z_correct = 1;
assert(isequal(lastzerorow(a),z_correct))
|
2 | Pass |
a = 1;
z_correct = 0;
assert(isequal(lastzerorow(a),z_correct))
|
3 | Pass |
a = randi(1000,1000,1);
z_correct = 0;
assert(isequal(lastzerorow(a),z_correct))
|
4 | Pass |
a = [0;1;0;2;0;3;0;4;0;5;0;6;0;7;0;8;0;9;0;10];
z_correct = 19;
assert(isequal(lastzerorow(a),z_correct))
|
5 | Pass |
n = randi(1000);
a = tril(ones(n));
z_correct = 0:n-1;
assert(isequal(lastzerorow(a),z_correct))
|
6 | Pass |
n = randi(1000);
a = tril(ones(n),-1);
z_correct = 1:n;
assert(isequal(lastzerorow(a),z_correct))
|
7 | Pass |
n = randi(1000);
d = randi(n-1);
a = tril(ones(n),-d);
z_correct = min((0:n-1)+d,n);
assert(isequal(lastzerorow(a),z_correct))
|
8 | Pass |
a = magic(10)-1;
z_correct = [0 0 1 0 0 0 0 0 0 0];
assert(isequal(lastzerorow(a),z_correct))
|
9 | Pass |
a = [0 0 9 0;
0 0 1 8;
0 0 4 0;
0 0 2 3;
0 6 7 5];
z_correct = [5 4 0 3];
assert(isequal(lastzerorow(a),z_correct))
|
10 | Pass |
a = [0 0 0 0 -4 0 0 0 0;
0 0 0 -3 -3 -3 0 0 0;
0 0 -2 3 -2 2 2 0 0;
0 -1 2 -1 1 -1 -1 1 0];
z_correct = [4 3 2 1 0 1 2 3 4];
assert(isequal(lastzerorow(a),z_correct))
|
831 Solvers
Project Euler: Problem 10, Sum of Primes
707 Solvers
1143 Solvers
Test if two numbers have the same digits
187 Solvers
The Answer to Life, the Universe, and Everything
383 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!