This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
n = 1;
t = 1;
assert(isequal(factorial(n),t))
|
2 | Fail |
n = 2;
t = 2;
assert(isequal(factorial(n),t))
|
3 | Fail |
n = 3;
t = 6;
assert(isequal(factorial (n),t))
|
4 | Pass |
n = 6;
t = 720;
|
Find the longest sequence of 1's in a binary sequence.
3369 Solvers
6280 Solvers
The Hitchhiker's Guide to MATLAB
2874 Solvers
299 Solvers
224 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!