shortest possible python pascal triangle code the contest is already finished, so I don't think it's cheating to ask:
I am trying to optimize this small contest: pascal triangle
I started with 4.72 and worked myself up to 7.48.
The best made a 9.05 but in perl, python2 best score is 8.25.
Unfortunately they don't let you look at what others did.
My current solution is the following:

l=[1]
print 1
while(len(l)&lt;31):
 print' '.join(map(str,l+[1]))
 l=[1]+map(lambda x,y:x+y,l,l[1:]+[1])


Now I tried to get rid of the loop in using list comprehension, but I am too new to python to get this done. Can anyone give me a hint for nested list comprehension shortening this code further down?

Thank you for your audience.
This is a bit shorter, but still no good:

 

l=[1]
while(len(l)&lt;32):
 print' '.join(map(str,l))
 l=[1]+map(int.__add__,l,l[1:]+[0])


And this one comes in at a score of 8.28 (credit to @primo):

l=[1];exec"print' '.join(map(str,l));l=map(sum,zip([0]+l,l+[0]));"*31