Find the nearest Prime by hallvabo

while 1:
 n=input();x=0
 while 1:
\x09v=n+x;x=~x+(x<0)
\x09if pow(2,v-1,v)<2>pow(13,v-1,v):print v;break

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

download

return top