visual Euclidean algorithm by Erik the Outgolfer

c=97,w,X,Y;main(i){char G[76]="%d,%d";scanf(G,&w,&Y);for(X=w;Y;++c){for(i=X;i;G[w-i--]=c);if(Y<X)X-=Y;else for(i=X;i--;--Y)puts(G);}}

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

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page