Problem 83. Prime factor digits

Solution 1014565

Submitted on 13 Oct 2016 by mItk

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	n = 2; p_correct = 1; assert(isequal(factor_digits(n),p_correct))
2	Pass	n = 26; p_correct = [1 0 0 0 0 1]; assert(isequal(factor_digits(n),p_correct))
3	Pass	n = 168; p_correct = [1 0 1 3]; assert(isequal(factor_digits(n),p_correct))
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))