Find the nearest Prime by *yuko*

do1;read*,n;i=0
2 do k=2,n**.5
if(mod(n-i,k)>0)cycle
m=i<1;i=m-i;goto2
enddo
1 print'(i0)',n-i
end

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

download

return to the top page