#include
int IsPrime(unsigned int number) {
unsigned int i;
if (number <= 1) return 0; // zero and one are not prime<br>
for (i=2; i*i <= number; i++) {<br> if (number % i == 0) return 0;
}
return 1;
}
int main(void) {
unsigned int i;
printf("Prime numbers:\n");
for (i=0; i <= 999; i++) {<br> if (IsPrime(i)) printf("%d\n", i);
}
return 0;
}