Cody

Problem 83. Prime factor digits

Solution 77499

Submitted on 17 Apr 2012 by Kuifeng
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))

p = 1

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

p = 1 0 0 0 0 1

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

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))

p = Columns 1 through 10 1 0 0 0 0 0 0 0 0 0 Columns 11 through 12 3 0

Suggested Problems

More from this Author95