Find the nearest Prime by *yuko*

1 read*,n;i=0
2 k=1
3 k=k+1;if(mod(n-i,k)>0)goto4;m=i<1;i=m-i;goto2
4 if(n>k*k)goto3;print'(i0)',n-i;goto1;end

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

download

return to the top page