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));
|
2 | Pass |
%%
x = [2 2 2 2 2 2];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
3 | Pass |
%%
x = [2 5 4 5 4];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
4 | Pass |
%%
x = [1 3 1 1 9 7];
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
5 | Pass |
%%
x = primes(100);
xi = split_it(x);
assert(isequal(sum(x(xi)),sum(x)/2));
|
Find the longest sequence of 1's in a binary sequence.
2439 Solvers
1046 Solvers
225 Solvers
Generate a random matrix A of (1,-1)
161 Solvers
192 Solvers