Pascal's triangle: Difference between revisions

Write a function that prints out the first n rows of the triangle (with <tt>f(1)</tt> yielding the row consisting of only the element 1). This can be done either by summing elements from the previous rows or using a binary coefficient or combination function. Behavior for <tt>n <= 0</tt> does not need to be uniform, but should be noted.

=={{header|Ada}}==

<lang ada>with Ada.Integer_Text_Io; use Ada.Integer_Text_Io;