Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 128205;
n = 4
y_correct = true;
assert(isequal(parasitic(x,n),y_correct))
n =
4
|
2 | Pass |
x = 179487;
n = 4;
y_correct = true;
assert(isequal(parasitic(x,n),y_correct))
|
3 | Pass |
x = 179487;
n = 3;
y_correct = false;
assert(isequal(parasitic(x,n),y_correct))
|
4 | Pass |
x = 142857;
n = 5;
y_correct = true;
assert(isequal(parasitic(x,n),y_correct))
|
5 | Pass |
x = 142857;
n = 4;
y_correct = false;
assert(isequal(parasitic(x,n),y_correct))
|
6 | Pass |
x = 142657;
n = 5;
y_correct = false;
assert(isequal(parasitic(x,n),y_correct))
|
7 | Pass |
x = 142857;
n = 4;
y_correct = false;
assert(isequal(parasitic(x,n),y_correct))
|
8 | Pass |
x = 1012658227848;
n = 8;
y_correct = true;
assert(isequal(parasitic(x,n),y_correct))
|
9 | Pass |
x = 1012658227848;
n = 4;
y_correct = false;
assert(isequal(parasitic(x,n),y_correct))
|
10 | Pass |
x = 142857;
n = 7;
y_correct = false;
assert(isequal(parasitic(x,n),y_correct))
|
11 | Pass |
x = 12;
n = 2;
y_correct = false;
assert(isequal(parasitic(x,n),y_correct))
|
Sum of diagonal of a square matrix
1159 Solvers
Make a run-length companion vector
453 Solvers
Create a vector whose elements depend on the previous element
290 Solvers
310 Solvers
394 Solvers