Cody

Problem 83. Prime factor digits

Solution 209429

Submitted on 27 Feb 2013 by Yaroslav
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

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.] [> In factor_digits at 2 In verifyCode>evaluateCode at 227 In verifyCode at 40 In fevalJSON at 14]

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.] [> In factor_digits at 2 In verifyCode>evaluateCode at 227 In verifyCode at 40 In fevalJSON at 14]

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

[Warning: Input should be a string.] [> In factor_digits at 2 In verifyCode>evaluateCode at 227 In verifyCode at 40 In fevalJSON at 14]

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.] [> In factor_digits at 2 In verifyCode>evaluateCode at 227 In verifyCode at 40 In fevalJSON at 14]

Suggested Problems

More from this Author95