Long Division FIXED by rotary-o

enum M{M;System z;{try{for(int d=z.in.read()%8,n=1-d*5%12,i=5,j=5;--i>n*4;)z.out.printf(i>n?i<0?"%d":" ":i<n?i>n*2?"_":i>n*3?i%n<0?"0":"\n9 | %d":"\n%"+j+(j<4-n?"d0\n%"+(j-2)+"c%3d\n%"+j+++"c_":"d"):"\n  ___",d,45,d*9,95);}catch(Exception e){}}}

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