Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 1;
y_correct = 1;
assert(isequal(wheat_chess(n),y_correct))
|
2 | Pass |
%%
n = 0;
y_correct = 0;
assert(isequal(wheat_chess(n),y_correct))
|
3 | Pass |
%%
n = -1;
y_correct = 'NaN';
assert(isequal(wheat_chess(n),y_correct))
y =
NaN
|
4 | Pass |
%%
n = 4;
y_correct = 65535;
assert(isequal(wheat_chess(n),y_correct))
|
5 | Pass |
%%
n = 8;
y_correct = 18446744073709551615;
assert(isequal(wheat_chess(n),y_correct))
|
6 | Pass |
%%
n = 10;
y_correct = 1267650600228229401496703205375;
assert(isequal(wheat_chess(n),y_correct))
|
Test if a Number is a Palindrome without using any String Operations
157 Solvers
Back to basics 8 - Matrix Diagonals
707 Solvers
307 Solvers
Who is the smartest MATLAB programmer?
469 Solvers
345 Solvers