196 algorithm by nn

(1..195).any{i->for(o=0;i-o;o=(i+'')[-1..0].toLong())i+=o
println i}

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

download

return to the top page