pascal's triangle python reverse function

# Python3 program for Pascal's Triangle
# A O(n^2) time and O(1) extra
# space method for Pascal's Triangle

# Pascal function
def printPascal(n):
    for line in range(1,n + 1):
        C = 1 # used to represent C(line, i)
        for i in range(1, line + 1):
            # The first value in a
            # line is always 1
            print(C, end = " ")
            C = int(C * (line - i) / i)
        print("")
n = 5
printPascal(n)

# This code is contributed by mits

#include <stdio.h>
#include <stdlib.h>

int main()
{
  int N;

  scanf("%d", &N);
  int pascalArray[N + 1][N + 1];
  int i, j;
  if(0 <= N && N <= 20)
  {
      for (i = 0; i < N + 1; i++)
      {
        for(j = 0; j <= i; j++)
        {
            if(j == 0 || j == i)
                pascalArray[i][j] = 1;
            else
                pascalArray[i][j] = pascalArray[i-1][j-1] + pascalArray[i-1][j];
            if (i == N)
                printf("%d ", pascalArray[i][j]);
        }
      }
  }
  return 0;
}

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)