196 algorithm by 51b

long long m=1,l,k;main(n){for(;l?:(m-k?l=m+=k:printf("%Ld\n",k,m=++n),k=0,n<196);l/=10)k=k*10+l%10;}

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

download

return to the top page