Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define n 100
- //bool prime[2];
- int main(){
- int prime[n];
- int i,num,loc;
- for(i=1;i<=n;i++){
- prime[i] = 1;
- }
- for( num = 2; num <= (int)sqrt(n);num++){
- if(prime[num]==1){
- loc = num+num;
- while(loc<=n){
- prime[loc] = 0;
- loc = loc + num;
- }
- }
- }
- for (i=1; i<=n; i++) {
- if(prime[i]==1){
- printf("%d \n",i);
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement