Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 5;
y_correct = ...
[1 1 1 1 1
1 0 0 0 0
1 1 1 1 1
1 0 0 0 0
1 1 1 1 1];
assert(isequal(your_fcn_name(x),y_correct))
|
2 | Pass |
x = 7;
y_correct = ...
[1 1 1 1 1 1 1
1 0 0 0 0 0 0
1 0 0 0 0 0 0
1 1 1 1 1 1 1
1 0 0 0 0 0 0
1 0 0 0 0 0 0
1 1 1 1 1 1 1]
assert(isequal(your_fcn_name(x),y_correct))
y_correct =
1 1 1 1 1 1 1
1 0 0 0 0 0 0
1 0 0 0 0 0 0
1 1 1 1 1 1 1
1 0 0 0 0 0 0
1 0 0 0 0 0 0
1 1 1 1 1 1 1
|
3 | Pass |
x = 11;
y_correct = ...
[1 1 1 1 1 1 1 1 1 1 1
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1]
assert(isequal(your_fcn_name(x),y_correct))
y_correct =
1 1 1 1 1 1 1 1 1 1 1
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
The Goldbach Conjecture, Part 2
1284 Solvers
Convert a numerical matrix into a cell array of strings
455 Solvers
Magic is simple (for beginners)
2749 Solvers
404 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!