Cody

Problem 83. Prime factor digits

Solution 2777836

Submitted on 4 Aug 2020
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Fail
n = 2; p_correct = 1; assert(isequal(factor_digits(n),p_correct))

gr = 2 gc = 1 Primes = 2

Assertion failed.

2   Fail
n = 26; p_correct = [1 0 0 0 0 1]; assert(isequal(factor_digits(n),p_correct))

gr = 13 2 gc = 1 1 Primes = 13 11 7 5 3 2

Assertion failed.

3   Fail
n = 168; p_correct = [1 0 1 3]; assert(isequal(factor_digits(n),p_correct))

gr = 7 3 2 gc = 1 1 3 Primes = 7 5 3 2

Assertion failed.

4   Fail
n = 999; p_correct = [1 0 0 0 0 0 0 0 0 0 3 0]; assert(isequal(factor_digits(n),p_correct))

gr = 37 3 gc = 1 3 Primes = 37 31 29 23 19 17 13 11 7 5 3 2

Assertion failed.