Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 1;
y_correct = 1;
assert(isequal(wheat_chess(n),y_correct))
ans =
1
|
2 | Pass |
%%
n = 0;
y_correct = 0;
assert(isequal(wheat_chess(n),y_correct))
ans =
0
|
3 | Pass |
%%
n = -1;
y_correct = 'NaN';
assert(isequal(wheat_chess(n),y_correct))
ans =
1
ans =
NaN
|
4 | Pass |
%%
n = 4;
y_correct = 65535;
assert(isequal(wheat_chess(n),y_correct))
ans =
65535
|
5 | Pass |
%%
n = 8;
y_correct = 18446744073709551615;
assert(isequal(wheat_chess(n),y_correct))
ans =
1.8447e+19
|
6 | Pass |
%%
n = 10;
y_correct = 1267650600228229401496703205375;
assert(isequal(wheat_chess(n),y_correct))
ans =
1.2677e+30
|
Test if a Number is a Palindrome without using any String Operations
157 Solvers
135 Solvers
Get the length of a given vector
1356 Solvers
577 Solvers
Side of an equilateral triangle
1518 Solvers