Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 56;
y = 1;
n = 1;
A_correct = 56;
assert(isequal(wheat_chess(x,y,n),A_correct))
|
2 | Pass |
%%
x = 1;
y = 2;
n = 8;
A_correct = 18446744073709551615;
assert(isequal(wheat_chess(x,y,n),A_correct))
|
3 | Pass |
%%
x = -1;
y = 2;
n = 8;
A_correct = -18446744073709551615;
assert(isequal(wheat_chess(x,y,n),A_correct))
|
4 | Pass |
%%
x = 5;
y = 3;
n = 2;
A_correct = 200;
assert(isequal(wheat_chess(x,y,n),A_correct))
|
5 | Pass |
%%
x = 10;
y = -5;
n = 3;
A_correct = 3255210;
assert(isequal(wheat_chess(x,y,n),A_correct))
|
6 | Pass |
%%
x = 1;
y = 0;
n = 1;
A_correct = 1;
assert(isequal(wheat_chess(x,y,n),A_correct))
|
7 | Pass |
%%
x = 1;
y = 0;
n = -1;
A_correct = 'NaN';
assert(isequal(wheat_chess(x,y,n),A_correct))
|
8 | Pass |
%%
x = 12;
y = 1;
n = 3;
A_correct = 108;
assert(isequal(wheat_chess(x,y,n),A_correct))
|
17130 Solvers
Back to basics 16 - byte order
149 Solvers
Given a window, how many subsets of a vector sum positive
673 Solvers
Create an n-by-n null matrix and fill with ones certain positions
140 Solvers
310 Solvers