Cody

# Problem 83. Prime factor digits

Solution 1759492

Submitted on 24 Mar 2019 at 7:43 by Samatha Aleti
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))

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

n = 13 temp = 1 p = 1 temp = 1 0 p = 0 1 temp = 1 0 0 p = 0 0 1 temp = 1 0 0 0 p = 0 0 0 1 temp = 1 0 0 0 0 p = 0 0 0 0 1 n = 1 temp = 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))

n = 84 n = 42 n = 21 temp = 3 p = 3 n = 7 temp = 3 1 p = 1 3 temp = 3 1 0 p = 0 1 3 n = 1 temp = 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))

temp = 0 p = 0 n = 333 n = 111 n = 37 temp = 0 3 p = 3 0 temp = 0 3 0 p = 0 3 0 temp = 0 3 0 0 p = 0 0 3 0 temp = 0 3 0 0 0 p = 0 0 0 3 0 temp = 0 3 0 0 0 0 p = 0 0 0 0 3 0 temp = 0 3 0 0 0 0 0 p = 0 0 0 0 0 3 0 temp = 0 3 0 0 0 0 0 0 p = 0 0 0 0 0 0 3 0 temp = 0 3 0 0 0 0 0 0 0 p = 0 0 0 0 0 0 0 3 0 temp = 0 3 0 0 0 0 0 0 0 0 p = 0 0 0 0 0 0 0 0 3 0 temp = 0 3 0 0 0 0 0 0 0 0 0 p = 0 0 0 0 0 0 0 0 0 3 0 n = 1 temp = 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