Graph by recursive

I=lambda*_:map(int,raw_input().split())
while 1:p,n=I();v=[1]+[0]*~-n;A=map(I,v);exec'v=[`sum(y*int(z)for y,z in zip(a,v))`for a in A];'*p;print" ".join(v[1:])

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return top