All primes from 0 to 1000 Is it possible to make this C code smaller? It prints out all primes from 0 to 1000.

C, 89 chars

int i,p,c;for(i=2;i&lt;1e3;i++){c=0;for(p=2;p&lt;i;p++)if(i%p==0)c++;if(c==0)printf("%u\n",i);}
67 bytes
In C there's no real alternative to trial division, but it can certainly be golfed a bit.
for(int p=1,d;p++&lt;999;d&amp;&amp;printf(&quot;%d\n&quot;,p))for(d=p;--d&gt;1;)d=p%d?d:1;

Requires C99 initial declarations, which saves 1 byte.