Cody

# Problem 83. Prime factor digits

Solution 1203155

Submitted on 2 Jun 2017 by Said BOUREZG
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))

ans = 37 31 29 23 19 17 13 11 7 5 3 2 s = 0 s = 0 0 s = 0 0 0 s = 0 0 0 0 s = 0 0 0 0 0 s = 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 0 0 0 1 ans = 12 ans = 1

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

ans = 37 31 29 23 19 17 13 11 7 5 3 2 s = 0 s = 0 0 s = 0 0 0 s = 0 0 0 0 s = 0 0 0 0 0 s = 0 0 0 0 0 0 s = 0 0 0 0 0 0 1 s = 0 0 0 0 0 0 1 0 s = 0 0 0 0 0 0 1 0 0 s = 0 0 0 0 0 0 1 0 0 0 s = 0 0 0 0 0 0 1 0 0 0 0 s = 0 0 0 0 0 0 1 0 0 0 0 1 ans = 7 12 ans = 1 0 0 0 0 1

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

ans = 37 31 29 23 19 17 13 11 7 5 3 2 s = 0 s = 0 0 s = 0 0 0 s = 0 0 0 0 s = 0 0 0 0 0 s = 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 s = 0 0 0 0 0 0 0 0 1 s = 0 0 0 0 0 0 0 0 1 0 s = 0 0 0 0 0 0 0 0 1 0 1 s = 0 0 0 0 0 0 0 0 1 0 1 3 ans = 9 11 12 ans = 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))

ans = 37 31 29 23 19 17 13 11 7 5 3 2 s = 1 s = 1 0 s = 1 0 0 s = 1 0 0 0 s = 1 0 0 0 0 s = 1 0 0 0 0 0 s = 1 0 0 0 0 0 0 s = 1 0 0 0 0 0 0 0 s = 1 0 0 0 0 0 0 0 0 s = 1 0 0 0 0 0 0 0 0 0 s = 1 0 0 0 0 0 0 0 0 0 3 s = 1 0 0 0 0 0 0 0 0 0 3 0 ans = 1 11 ans = 1 0 0 0 0 0 0 0 0 0 3 0