This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Ha! Out of memory error for matrix multiplication :)
| Test | Status | Code Input and Output |
|---|---|---|
| 1 | Pass |
x = [1 2 3 4 5 6 7];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
ans =
64×7 logical array
0 0 0 0 0 0 1
0 0 0 0 0 1 0
0 0 0 0 0 1 1
0 0 0 0 1 0 0
0 0 0 0 1 0 1
0 0 0 0 1 1 0
0 0 0 0 1 1 1
0 0 0 1 0 0 0
0 0 0 1 0 0 1
0 0 0 1 0 1 0
0 0 0 1 0 1 1
0 0 0 1 1 0 0
0 0 0 1 1 0 1
0 0 0 1 1 1 0
0 0 0 1 1 1 1
0 0 1 0 0 0 0
0 0 1 0 0 0 1
0 0 1 0 0 1 0
0 0 1 0 0 1 1
0 0 1 0 1 0 0
0 0 1 0 1 0 1
0 0 1 0 1 1 0
0 0 1 0 1 1 1
0 0 1 1 0 0 0
0 0 1 1 0 0 1
0 0 1 1 0 1 0
0 0 1 1 0 1 1
0 0 1 1 1 0 0
0 0 1 1 1 0 1
0 0 1 1 1 1 0
0 0 1 1 1 1 1
0 1 0 0 0 0 0
0 1 0 0 0 0 1
0 1 0 0 0 1 0
0 1 0 0 0 1 1
0 1 0 0 1 0 0
0 1 0 0 1 0 1
0 1 0 0 1 1 0
0 1 0 0 1 1 1
0 1 0 1 0 0 0
0 1 0 1 0 0 1
0 1 0 1 0 1 0
0 1 0 1 0 1 1
0 1 0 1 1 0 0
0 1 0 1 1 0 1
0 1 0 1 1 1 0
0 1 0 1 1 1 1
0 1 1 0 0 0 0
0 1 1 0 0 0 1
0 1 1 0 0 1 0
0 1 1 0 0 1 1
0 1 1 0 1 0 0
0 1 1 0 1 0 1
0 1 1 0 1 1 0
0 1 1 0 1 1 1
0 1 1 1 0 0 0
0 1 1 1 0 0 1
0 1 1 1 0 1 0
0 1 1 1 0 1 1
0 1 1 1 1 0 0
0 1 1 1 1 0 1
0 1 1 1 1 1 0
0 1 1 1 1 1 1
1 0 0 0 0 0 0
ans =
3 5 6
|
| 2 | Pass |
x = [2 2 2 2 2 2];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
ans =
32×6 logical array
0 0 0 0 0 1
0 0 0 0 1 0
0 0 0 0 1 1
0 0 0 1 0 0
0 0 0 1 0 1
0 0 0 1 1 0
0 0 0 1 1 1
0 0 1 0 0 0
0 0 1 0 0 1
0 0 1 0 1 0
0 0 1 0 1 1
0 0 1 1 0 0
0 0 1 1 0 1
0 0 1 1 1 0
0 0 1 1 1 1
0 1 0 0 0 0
0 1 0 0 0 1
0 1 0 0 1 0
0 1 0 0 1 1
0 1 0 1 0 0
0 1 0 1 0 1
0 1 0 1 1 0
0 1 0 1 1 1
0 1 1 0 0 0
0 1 1 0 0 1
0 1 1 0 1 0
0 1 1 0 1 1
0 1 1 1 0 0
0 1 1 1 0 1
0 1 1 1 1 0
0 1 1 1 1 1
1 0 0 0 0 0
ans =
4 5 6
|
| 3 | Pass |
x = [2 5 4 5 4];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
ans =
16×5 logical array
0 0 0 0 1
0 0 0 1 0
0 0 0 1 1
0 0 1 0 0
0 0 1 0 1
0 0 1 1 0
0 0 1 1 1
0 1 0 0 0
0 1 0 0 1
0 1 0 1 0
0 1 0 1 1
0 1 1 0 0
0 1 1 0 1
0 1 1 1 0
0 1 1 1 1
1 0 0 0 0
ans =
2 4
|
| 4 | Pass |
x = [1 3 1 1 9 7];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
ans =
32×6 logical array
0 0 0 0 0 1
0 0 0 0 1 0
0 0 0 0 1 1
0 0 0 1 0 0
0 0 0 1 0 1
0 0 0 1 1 0
0 0 0 1 1 1
0 0 1 0 0 0
0 0 1 0 0 1
0 0 1 0 1 0
0 0 1 0 1 1
0 0 1 1 0 0
0 0 1 1 0 1
0 0 1 1 1 0
0 0 1 1 1 1
0 1 0 0 0 0
0 1 0 0 0 1
0 1 0 0 1 0
0 1 0 0 1 1
0 1 0 1 0 0
0 1 0 1 0 1
0 1 0 1 1 0
0 1 0 1 1 1
0 1 1 0 0 0
0 1 1 0 0 1
0 1 1 0 1 0
0 1 1 0 1 1
0 1 1 1 0 0
0 1 1 1 0 1
0 1 1 1 1 0
0 1 1 1 1 1
1 0 0 0 0 0
ans =
3 4 5
|
| 5 | Fail |
x = primes(100);
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
Back to basics 3 - Temp Directory
272 Solvers
What is the distance from point P(x,y) to the line Ax + By + C = 0?
174 Solvers
185 Solvers
Create matrix of replicated elements
249 Solvers
380 Solvers