Pascal triangle python

def printPascal(n):  
  
    for i in range(1,n + 1):  
        m = 1;  
        for j in range(1,i + 1):
            print(m, end = " ")
            m = int(m * (i - j) / j)  
        print("")
          
printPascal(int(input()))

#code by fawlid

Pascal's triangle python

def solve(A):
    pascals_triangle = []

    for i in range(A):
        pascals_triangle.append([1]*(i+1))
  
    for i in range(2,A):
        for j in range(1,i):
            pascals_triangle[i][j] = pascals_triangle[i-1][j-1] + pascals_triangle[i-1][j]

    return pascals_triangle

Pascal's triangle python reverse function

def pascal_triangle(n):
   	trow = [1]
   	y = [0]
   	for x in range(max(n,0)):
      	print(trow)
      	trow=[l+r for l,r in zip(trow+y, y+trow)]
   	return n>=1
pascal_triangle(6)

Similar codes

12 votes266 views4 answers
Couldn't find a tree builder with the features you requested: lxml. Do you need to install a parser library?
Python
0 vote203 views1 answer
Machine learning project outline
Python
9 votes228 views2 answers
Keras model save
Python
0 vote193 views1 answer
How to open cmd at specific size using python
Python
2 votes198 views1 answer
Python sort list by last element
Python
1 vote202 views1 answer
Pandas convert multiple columns to categorical
Python
0 vote195 views2 answers
Python - create frequency table between two columns
Python
16 votes208 views1 answer
Python reload function from file
Python
1 vote188 views1 answer
Install python3.6 in linux
Python
11 votes285 views5 answers
Linear regression in python
Python