prime powers by teebee

for(n=1;i||++n<i=999;a[n*i]+=!a[n])if(a[n]<2*!--i)n

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