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 | Pass |
n = 7;
S_correct = ...
[1 1 1 1 1 1 1;
1 0 0 0 0 0 1;
1 0 1 1 1 0 1;
1 0 1 0 1 0 1;
1 0 1 1 1 0 1;
1 0 0 0 0 0 1;
1 1 1 1 1 1 1];
Sn_correct = 2;
[S,Sn] = squaresinsquares(n);
assert(isequal(S,S_correct));
assert(isequal(Sn,Sn_correct));
Sn =
2
Sn =
3
Sn =
4
|
2 | Pass |
n = 2;
S_correct = [1 1; 1 1];
Sn_correct = 1;
[S,Sn] = squaresinsquares(n);
assert(isequal(S,S_correct));
assert(isequal(Sn,Sn_correct));
|
3 | Pass |
n = 1;
S_correct = 1;
Sn_correct = 1;
[S,Sn] = squaresinsquares(n);
assert(isequal(S,S_correct));
assert(isequal(Sn,Sn_correct));
|
4 | Pass |
n = 10;
Sn_correct = 3;
[~,Sn] = squaresinsquares(n);
assert(isequal(Sn,Sn_correct));
Sn =
2
Sn =
3
Sn =
4
Sn =
5
|
5 | Pass |
n = 6;
S_correct = ...
[1 1 1 1 1 1;
1 0 0 0 0 1;
1 0 1 1 0 1;
1 0 1 1 0 1;
1 0 0 0 0 1;
1 1 1 1 1 1];
Sn_correct = 2;
[S,Sn] = squaresinsquares(n);
assert(isequal(S,S_correct));
assert(isequal(Sn,Sn_correct));
Sn =
2
Sn =
3
|
Return unique values without sorting
588 Solvers
725 Solvers
345 Solvers
132 Solvers
Replace pattern 0 1 0 and 1 0 1
81 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!