Cody

Solution 230435

Submitted on 14 Apr 2013 by Claudio Gelmi
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
%% seed=3;n=6; [Z,y] = findPerfectZ(seed,n); Z_correct = 25; y_correct = 4; assert(isequal(Z,Z_correct)); assert(isequal(y,y_correct));
y = 4
2   Pass
%% seed=5;n=15; [Z,y] = findPerfectZ(seed,n); Z_correct = 169; y_correct = 12; assert(isequal(Z,Z_correct)); assert(isequal(y,y_correct));
y = 12
3   Pass
%% seed=4;n=6; [Z,y] = findPerfectZ(seed,n); Z_correct = 25; y_correct = 3; assert(isequal(Z,Z_correct)); assert(isequal(y,y_correct));
y = 3
4   Pass
%% seed=12;n=15; [Z,y] = findPerfectZ(seed,n); Z_correct = 169; y_correct = 5; assert(isequal(Z,Z_correct)); assert(isequal(y,y_correct));
y = 5
5   Pass
%% seed=6;n=9; [Z,y] = findPerfectZ(seed,n); Z_correct = 100; y_correct = 8; assert(isequal(Z,Z_correct)); assert(isequal(y,y_correct));
y = 8
6   Pass
%% seed=8;n=9; [Z,y] = findPerfectZ(seed,n); Z_correct = 100; y_correct = 6; assert(isequal(Z,Z_correct)); assert(isequal(y,y_correct));
y = 6