input: Write a function to compute the nth row of Pascal's triangle.
  assert nth_row_pascal(0) == [1]
  assert nth_row_pascal(1) == [1, 1]
  assert nth_row_pascal(2) == [1, 2, 1]
  assert nth_row_pascal(3) == [1, 3, 3, 1]
  assert nth_row_pascal(4) == [1, 4, 6, 4, 1]
output: def nth_row_pascal(n):
      if n == 0:
          return [1]
      row = [1]
      for k in range(1, n + 1):
          row.append(row[-1] * (n - k + 1) // k)
      return row