Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
m = 2; n = 2 ; l = 5;
y_correct = 30;
assert(isequal(count3dPath(m,n,l),y_correct))
|
2 | Pass |
m = 8; n = 5 ; l = 2;
y_correct = 3960;
assert(isequal(count3dPath(m,n,l),y_correct))
|
3 | Pass |
m = 5; n = 5 ; l = 10;
y_correct = 1701700;
assert(isequal(count3dPath(m,n,l),y_correct))
|
4 | Pass |
m = 8; n = 4 ; l=2;
y_correct = 1320;
assert(isequal(count3dPath(m,n,l),y_correct))
|
Maximum running product for a string of numbers
816 Solvers
231 Solvers
322 Solvers
342 Solvers
57 Solvers