Cody

Solution 496703

Submitted on 6 Sep 2014 by Peter Cook
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 = 3; y_correct = []; assert(isequal(pandigital_sum(x),y_correct))

2   Pass
%% x = 4; y_correct = 12; assert(isequal(pandigital_sum(x),y_correct))

3   Pass
%% x = 5; y_correct = 52; assert(isequal(pandigital_sum(x),y_correct))

4   Pass
%% x = 6; y_correct = 162; assert(isequal(pandigital_sum(x),y_correct))

5   Pass
%% x = 7; y_correct = []; % Strange no ? assert(isequal(pandigital_sum(x),y_correct))

6   Pass
%% x = 8; y_correct = 13458; assert(isequal(pandigital_sum(x),y_correct))

7   Pass
%% You obtain the Project Euler n�32 solution with n=9

Suggested Problems