Pascal's triangle

[nvakada]

Pascal's triangle is a mathematical array of binomial coefficients. write a program that outputs the Nth row of the triangle, where N is given as input integer. In following good computer science tradition, we'll define the first row to be row 0. Implementations should support up to row 53.

[nilamo]

We won't do it for you. Give your homework a try, and if you have trouble, we'll help.

But we won't do it for you.

[nvakada]

#!/usr/local/bin/python
# input =5
# 1
# 1 1
# 1 2 1
# 1 3 3 1
# 1 4 6 4 1

import sys

num = input("How many levels of Pascals Traingle?")
num += 1

if (num ==1):
     print("1")
     sys.exit()

upper = [None] * num
lower = [None] * num

upper[0] = 1
upper[1] = 1
upper[0] = 1
upper[0] = 1

def assignArray( a, b, size ):
    for x in range(size):
        a[x] = b[x]
    return

for x in range(num):
    for z in range(x):
        # check for edges
        # if not in edge upper array add values
        if(z == 0 or z == x - 1):
            print('1'),
            lower[z] = 1
        else :
            lower[z] = upper[z-1] + upper[z]
            print(lower[z]),

    assignArray(upper, lower, x)
    print(" ")

[micseydel]

What about it doesn't work? Park of making an effort is explaining what you tried and what you expected clearly, ideally isolating it to the most minimal amount of code that reproduces your problem.

[woooee]

Explain to yourself in words what the relationship is between this row and the previous row and then start to code once that is clear.

[Skaperen]

sounds like a fun project. are you going to code this in Python? i've done something like this before, though not in Python. maybe i should do one in Python. i'll show you mine if you show me yours (working code) first.