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))
|
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))
|
Return elements unique to either input
478 Solvers
Find nearest prime number less than input number
183 Solvers
Multiples of a Number in a Given Range
141 Solvers
Is the paranthesis sequence balanced ?
73 Solvers
244 Solvers