196 algorithm by nn

for(i=0;i++<195;print(j))for(j=i,o=0;j-o;)for([,k]in(j-=-o)+(o=''))o=k+o

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

download

return to the top page