deftriangles(max):
L = []
for n inrange(max):
if n ==0:
L.insert(n, 1)
yield(L)
elif n ==1:
elif n >1:
x = n
M = L
L.append(1)
while x >1:
L[x-1] = M[x-1] + M[x-2]
x = x -1
Sign in to make a reply
Blind-Monster
deftriangles(max):
L = []
for n inrange(max):
if n ==0:
L.insert(n, 1)
yield(L)
elif n ==1:
L.insert(n, 1)
yield(L)
elif n >1:
x = n
M = L
L.append(1)
while x >1:
L[x-1] = M[x-1] + M[x-2]
x = x -1
yield(L)