Cody

Solution 722324

Submitted on 25 Aug 2015 by kfncgnhx eprueqxc
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
%% Grid with N=1 doesn't cut the orange, it represents the smallest cube that orange can fit in. There are no juicy cubes, one piece sorrounded by peel. N = 1; y_correct = [0 1]; assert(isequal(cut_orange(N),y_correct))

pieces = 0 1

2   Pass
%% N = 1; y_correct = [0 1]; assert(isequal(cut_orange(N),y_correct))

pieces = 0 1

3   Pass
%% N = 2; y_correct = [0 8]; assert(isequal(cut_orange(N),y_correct))

pieces = 0 8

4   Pass
%% N = 3; y_correct = [1 26]; assert(isequal(cut_orange(N),y_correct))

pieces = 1 26

5   Pass
%% N = 4; y_correct = [8 56]; assert(isequal(cut_orange(N),y_correct))

pieces = 8 56

6   Pass
%% N = 5; y_correct = [19 98]; % was [27 90] assert(isequal(cut_orange(N),y_correct))

pieces = 19 98

7   Pass
%% N = 6; y_correct = [32 152]; % was [56 128]; assert(isequal(cut_orange(N),y_correct))

pieces = 32 152

8   Pass
%% N = 7; y_correct = [81 194]; assert(isequal(cut_orange(N),y_correct))

pieces = 81 194

9   Pass
%% N = 8; y_correct = [136 272]; % was [160 248]; assert(isequal(cut_orange(N),y_correct))

pieces = 136 272

10   Pass
%% N = 9; y_correct = [203 362]; % was [251 314]; assert(isequal(cut_orange(N),y_correct))

pieces = 203 362

11   Pass
%% N = 10; y_correct = [304 416]; % was [312 408]; assert(isequal(cut_orange(N),y_correct))

pieces = 304 416

12   Pass
%% % finally more cubes than peels! N = 13; assert(isequal(-diff(cut_orange(N)),5))

pieces = 751 746

13   Pass
%% N = 19; y_correct = [2769 1658]; assert(isequal(cut_orange(N),y_correct))

pieces = 2769 1658