Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
v = [2, 3, 5];
n = 8;
correct = [2, 3];
actual = subset_sum(v, n);
assert(isequal(actual, correct))
ind =
2 3
|
2 | Pass |
v = [5, 3, 2];
n = 2;
correct = 3;
actual = subset_sum(v, n);
assert(isequal(actual, correct))
ind =
3
|
3 | Pass |
v = [2, 3, 5];
n = 4;
correct = [];
actual = subset_sum(v, n);
assert(isequal(actual, correct))
ind =
[]
|
4 | Fail |
v = [1, 1, 1, 1, 1];
n = 5;
correct = [1, 2, 3, 4, 5];
actual = subset_sum(v, n);
assert(isequal(actual, correct))
ind =
[]
|
5 | Pass |
v = [1, 2, 3, 4, 100];
n = 100;
correct = 5;
actual = subset_sum(v, n);
assert(isequal(actual, correct))
ind =
5
|
6 | Fail |
v = [-7, -3, -2, 8, 5];
n = 0;
correct = [2, 3, 5];
actual = subset_sum(v, n);
assert(isequal(actual, correct))
ind =
[]
|
5695 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
187 Solvers
Make a run-length companion vector
453 Solvers
477 Solvers