prime powers by chocobi

a[999];main(c,v){for(;++c<999;a[c]<2&&printf("%d\n",c))if(!a[v=c])for(;v<999;v+=c)++a[v];}

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

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page