Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 2;
p_correct = 1;
assert(isequal(factor_digits(n),p_correct))
f =
2
p =
1
|
2 | Pass |
n = 26;
p_correct = [1 0 0 0 0 1];
assert(isequal(factor_digits(n),p_correct))
f =
2 13
p =
1 0 0 0 0 1
|
3 | Pass |
n = 168;
p_correct = [1 0 1 3];
assert(isequal(factor_digits(n),p_correct))
f =
2 2 2 3 7
p =
1 0 1 3
|
4 | Pass |
n = 999;
p_correct = [1 0 0 0 0 0 0 0 0 0 3 0];
assert(isequal(factor_digits(n),p_correct))
f =
3 3 3 37
p =
1 0 0 0 0 0 0 0 0 0 3 0
|
Project Euler: Problem 6, Natural numbers, squares and sums.
784 Solvers
Rotate and display numbered tile
221 Solvers
263 Solvers
197 Solvers
Create a two dimensional zero matrix
275 Solvers