Find the nearest Prime by not

k;main(n,i){for(;k=scanf("%d",&n)>0;printf("%d\n",n+i))for(i=0;(n+i)%++k?n>k*k:(i=~i+(i<0),k=1););}

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

download

return to the top page