Cody

# Problem 37. Pascal's Triangle

Solution 1408936

Submitted on 7 Jan 2018 by claus becker
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))

y = 1

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

P = 1 1 1 2 nth_row = 1 1

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

P = 1 1 1 1 2 3 1 3 6 nth_row = 1 2 1

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

P = 1 1 1 1 1 2 3 4 1 3 6 10 1 4 10 20 nth_row = 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))

P = 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 10 11 1 3 6 10 15 21 28 36 45 55 66 1 4 10 20 35 56 84 120 165 220 286 1 5 15 35 70 126 210 330 495 715 1001 1 6 21 56 126 252 462 792 1287 2002 3003 1 7 28 84 210 462 924 1716 3003 5005 8008 1 8 36 120 330 792 1716 3432 6435 11440 19448 1 9 45 165 495 1287 3003 6435 12870 24310 43758 1 10 55 220 715 2002 5005 11440 24310 48620 92378 1 11 66 286 1001 3003 8008 19448 43758 92378 184756 nth_row = 1 10 45 120 210 252 210 120 45 10 1