Cody

Problem 83. Prime factor digits

Solution 2770579

Submitted on 3 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))

a = 0 p = 2

Assertion failed.

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

a = 5 p = 0 0 0 13

Assertion failed.

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

a = 3 p = []

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))

a = 10 p = []

Assertion failed.