Pascal's triangle/Puzzle: Difference between revisions

=={{header|Ada}}==

The solution makes an upward run symbolically, though excluding Z. After that two blocks (1,1) and (3,1) being known yield a 2x2 linear system, from which X and Y are determined. Finally each block is revisited and printed.

with Ada.Text_IO; use Ada.Text_IO;

end loop;

end Pyramid_of_Numbers;

Sample output:

<pre>

=={{header|Python}}==

{{works with|Python|2.4+}}

# [151]

# [ ] [ ]

addlConstraint = { 'X':1, 'Y':-1, 'Z':1, '1':0 }

SolvePyramid( p, addlConstraint)

Output:

<pre>Constraint Equations: