Cody

# Problem 37. Pascal's Triangle

Solution 228737

Submitted on 9 Apr 2013 by VIVI
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
%% n = 0; correct = [1]; assert(isequal(pascalTri(n),correct))

ret = 1

2   Pass
%% n = 1; correct = [1 1]; assert(isequal(pascalTri(n),correct))

ret = 1 0 ret = 1 1

3   Pass
%% n = 2; correct = [1 2 1]; assert(isequal(pascalTri(n),correct))

ret = 1 0 0 ret = 1 2 0 ret = 1 2 1

4   Pass
%% n = 3; correct = [1 3 3 1]; assert(isequal(pascalTri(n),correct))

ret = 1 0 0 0 ret = 1 3 0 0 ret = 1 3 3 0 ret = 1 3 3 1

5   Pass
%% n = 10; correct = [1 10 45 120 210 252 210 120 45 10 1]; assert(isequal(pascalTri(n),correct))

ret = 1 0 0 0 0 0 0 0 0 0 0 ret = 1 10 0 0 0 0 0 0 0 0 0 ret = 1 10 45 0 0 0 0 0 0 0 0 ret = 1 10 45 120 0 0 0 0 0 0 0 ret = 1 10 45 120 210 0 0 0 0 0 0 ret = 1 10 45 120 210 252 0 0 0 0 0 ret = 1 10 45 120 210 252 210 0 0 0 0 ret = 1 10 45 120 210 252 210 120 0 0 0 ret = 1 10 45 120 210 252 210 120 45 0 0 ret = 1 10 45 120 210 252 210 120 45 10 0 ret = 1 10 45 120 210 252 210 120 45 10 1