visual Euclidean algorithm by rotary-o

eval"a=#{gets}
b=['']*a[1]
(?a..?z).map{|c|d=a.min
d.times{|l|b[l-a[1]]+=c*d}
a[d/a[0]]-=d}
puts b"

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