input: Write a function that prints out the Pascal's triangle for a given number of rows. The function should take an integer `n` as input, which represents the number of rows to print. If `n` is less than 1, the function should not print anything and return `False`. Otherwise, it should print the Pascal's triangle for `n` rows and return `True`.
  
  def pascal_triangle(n):
      if n < 1:
          return False
      trow = [1]
      y = [0]
      for x in range(n):
          print(trow)
          trow = [l + r for l, r in zip(trow + y, y + trow)]
      return True
  
  assert pascal_triangle(0) == False
  assert pascal_triangle(1) == True
  assert pascal_triangle(5) == True
  assert pascal_triangle(-3) == False
  assert pascal_triangle(3) == True
output: def pascal_triangle(n):
      if n < 1:
          return False
      trow = [1]
      y = [0]
      for x in range(n):
          print(trow)
          trow = [l + r for l, r in zip(trow + y, y + trow)]
      return True