Euclids orchard by *yuko*

var i,j,k,n:word;begin read(n);for i:=1to n do for
j:=1to n do begin k:=n;while i mod k+j mod k>0do
k:=k-1;write((" t")[1div k+1],^j:j div n)end end.

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

download

return to the top page