Cody

# Problem 83. Prime factor digits

Solution 1936919

Submitted on 15 Sep 2019 by ChanXy
• Size: 7
• This is the leading solution.
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: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.] [> In unix (line 32) In factor_digits (line 2) In ScoringEngineTestPoint1 (line 3) In solutionTest (line 3)]

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

[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.] [> In unix (line 32) In factor_digits (line 2) In ScoringEngineTestPoint2 (line 3) In solutionTest (line 5)]

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

[Warning: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.] [> In unix (line 32) In factor_digits (line 2) In ScoringEngineTestPoint3 (line 3) In solutionTest (line 7)]

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: Function assert has the same name as a MATLAB builtin. We suggest you rename the function to avoid a potential name conflict.] [> In unix (line 32) In factor_digits (line 2) In ScoringEngineTestPoint4 (line 3) In solutionTest (line 9)]