Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
x = 0;
y_correct = 2;
assert(isequal(nearestprime(x),y_correct))
idx =
1×0 empty double row vector
y =
1×0 empty double row vector
|
2 | Pass |
x = 5;
y_correct = 5;
assert(isequal(nearestprime(x),y_correct))
idx =
3
y =
5
|
3 | Fail |
x = 100;
y_correct = 101;
assert(isequal(nearestprime(x),y_correct))
idx =
25
y =
97
|
4 | Pass |
x = 500;
y_correct = 499;
assert(isequal(nearestprime(x),y_correct))
idx =
95
y =
499
|
5 | Pass |
x = 911;
y_correct = 911;
assert(isequal(nearestprime(x),y_correct))
idx =
156
y =
911
|
6 | Fail |
x = 2500;
y_correct = 2503;
assert(isequal(nearestprime(x),y_correct))
idx =
367
y =
2477
|
7 | Pass |
x = 8000;
y_correct = 7993;
assert(isequal(nearestprime(x),y_correct))
idx =
1007
y =
7993
|
8 | Fail |
x = 100000;
y_correct = 100003;
assert(isequal(nearestprime(x),y_correct))
idx =
9592
y =
99991
|
9 | Pass |
x = 1300000;
y_correct = 1299989;
assert(isequal(nearestprime(x),y_correct))
idx =
100021
y =
1299989
|
10 | Fail |
x = 179424710;
y_correct = 179424719;
assert(isequal(nearestprime(x),y_correct))
idx =
10000002
y =
179424697
|
1166 Solvers
Get the elements of diagonal and antidiagonal for any m-by-n matrix
199 Solvers
Reverse the elements of an array
564 Solvers
272 Solvers
Is this is a Tic Tac Toe X Win?
369 Solvers