Cody

# Problem 83. Prime factor digits

Solution 1481882

Submitted on 6 Apr 2018 by Yanni Wang
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))

b = 2 index = 1 appear_time = 1 sequence = 2 p = 1 p = 1

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

b = 2 13 index = 1 2 appear_time = 1 1 sequence = 13 11 7 5 3 2 p = 1 0 0 0 0 1 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))

b = 2 3 7 index = 1 1 1 2 3 appear_time = 3 1 1 sequence = 7 5 3 2 p = 1 0 1 1 p = 1 0 1 3 p = 1 0 1 3 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))

b = 3 37 index = 1 1 1 2 appear_time = 3 1 sequence = 37 31 29 23 19 17 13 11 7 5 3 2 p = 1 0 0 0 0 0 0 0 0 0 1 0 p = 1 0 0 0 0 0 0 0 0 0 3 0 p = 1 0 0 0 0 0 0 0 0 0 3 0