Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [1 -2 1];
y_correct = [1;1];
assert(isequal(solvepol(x),y_correct))
|
2 | Pass |
x = [1 -3 2];
y_correct = [2;1];
assert(isequal(solvepol(x),y_correct))
|
10734 Solvers
350 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
Sum of diagonal of a square matrix
1159 Solvers
158 Solvers