Algorithm: 에라토스테네스의 체(Eratosthenes' Sieve)

// Made by BAMU

#include <stdio.h>

void main(){

int sieve[1001];

int i;

for(i=2;i<1001;i++){

sieve[i] = 1;

}

for(i=2; i<=(1000)/2; i++){

sieve[2*i] = 0;

}

for(i=2; i<=(1000)/3; i++){

sieve[3*i] = 0;

}

for(i=2; i<=(1000)/5; i++){

sieve[5*i] = 0;

} 

for(i=2; i<=1000; i++){

if(sieve[i]) printf("%d\n",i);

}

}

[참고자료]

http://ko.wikipedia.org/wiki/%EC%97%90%EB%9D%BC%ED%86%A0%EC%8A%A4%ED%85%8C%EB%84%A4%EC%8A%A4%EC%9D%98_%EC%B2%B4