Cody

# Problem 1925. Smith numbers

Solution 702559

Submitted on 17 Jul 2015 by Tomasz
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
%% x = 4; tf_correct = true; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) f = 2 2 ans = 1

2   Pass
%% x = 265; tf_correct = true; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) f = 5 53 ans = 1

3   Pass
%% x = 588; tf_correct = true; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) f = 2 2 3 7 7 ans = 1

4   Pass
%% x = 1086; tf_correct = true; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) f = 2 3 181 ans = 1

5   Pass
%% x = 4937775; tf_correct = true; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) f = 3 5 5 65837 ans = 1

6   Pass
%% x = 5; tf_correct = false; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) f = 5 ans = 0

7   Pass
%% x = 1000; tf_correct = false; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) f = 2 2 2 5 5 5 ans = 0

8   Pass
%% x = 94.1; tf_correct = false; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) ans = 0

9   Pass
%% x = 202.689; tf_correct = false; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) ans = 0

10   Pass
%% x = pi; tf_correct = false; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) ans = 0

11   Pass
%% x = -4; tf_correct = false; assert(isequal(isSmith(x),tf_correct ))

ds = @(x)sum(arrayfun(@(x)sum(num2str(x)-'0'),x)) ans = 0

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!