Cody

# Problem 83. Prime factor digits

Solution 2090537

Submitted on 13 Jan 2020 by Bryan Lambo
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))

[Warning: Input should be a string, character array, or cell array of character arrays.] [> In factor_digits (line 2) In ScoringEngineTestPoint1 (line 3) In solutionTest (line 3)] ans = 1

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

[Warning: Input should be a string, character array, or cell array of character arrays.] [> In factor_digits (line 2) In ScoringEngineTestPoint2 (line 3) In solutionTest (line 5)] ans = 1 0 0 0 0 1

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

[Warning: Input should be a string, character array, or cell array of character arrays.] [> In factor_digits (line 2) In ScoringEngineTestPoint3 (line 3) In solutionTest (line 7)] 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))

[Warning: Input should be a string, character array, or cell array of character arrays.] [> In factor_digits (line 2) In ScoringEngineTestPoint4 (line 3) In solutionTest (line 9)] ans = 1 0 0 0 0 0 0 0 0 0 3 0