Cody

# Problem 83. Prime factor digits

Solution 2027404

Submitted on 19 Nov 2019 at 8:41 by saeedeh ostovari
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   Pass
n = 2; p_correct = 1; assert(isequal(factor_digits(n),p_correct))

p = 1 p = 1

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

p = 1 3 5 7 11 13 p = 1 0 5 7 11 13 p = 1 0 0 7 11 13 p = 1 0 0 0 11 13 p = 1 0 0 0 0 13 p = 1 0 0 0 0 1 p = 1 0 0 0 0 1

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

p = 3 3 5 7 p = 3 1 5 7 p = 3 1 0 7 p = 3 1 0 1 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))

p = 0 3 5 7 11 13 17 19 23 29 31 37 p = 0 3 5 7 11 13 17 19 23 29 31 37 p = 0 3 0 7 11 13 17 19 23 29 31 37 p = 0 3 0 0 11 13 17 19 23 29 31 37 p = 0 3 0 0 0 13 17 19 23 29 31 37 p = 0 3 0 0 0 0 17 19 23 29 31 37 p = 0 3 0 0 0 0 0 19 23 29 31 37 p = 0 3 0 0 0 0 0 0 23 29 31 37 p = 0 3 0 0 0 0 0 0 0 29 31 37 p = 0 3 0 0 0 0 0 0 0 0 31 37 p = 0 3 0 0 0 0 0 0 0 0 0 37 p = 0 3 0 0 0 0 0 0 0 0 0 1 p = 1 0 0 0 0 0 0 0 0 0 3 0