fork download
  1. #include<stdio.h>
  2. #include <stdlib.h>
  3. #define MAX 100
  4.  
  5. int Sieb_des_Eratosthenes()
  6. {
  7. long long unsigned int i, j, x;
  8. x = 0;
  9. char *array;
  10. array = calloc((MAX + 1), sizeof(char));
  11. if (array==NULL) {
  12. printf("Error allocating memory!\n");
  13. return -1; //return with failure
  14. }
  15.  
  16. for(i = 2; i <= sqrt(MAX); i++)
  17. {
  18. if(array[i] == 0)
  19. {
  20. //array[i] = 1;
  21. x++;
  22. printf("prime %d ", i);
  23. for(j = i * i; j <= MAX; j += i)
  24. {
  25. array[j] = 1;
  26. }
  27. }
  28. }
  29.  
  30. printf("Found: %d\n", x);
  31.  
  32. for(i = 2; i <= MAX; i++) {
  33. if (array[i] == 0) {
  34. printf("Is prime: %d\n", i);
  35. }
  36. }
  37.  
  38. free(array);
  39. array = NULL;
  40. return 0;
  41. }
  42.  
  43. main()
  44. {
  45. return Sieb_des_Eratosthenes();
  46. }
Success #stdin #stdout 0s 1964KB
stdin
Standard input is empty
stdout
prime 2 prime 3 prime 5 prime 7 Found: 4
Is prime: 2
Is prime: 3
Is prime: 5
Is prime: 7
Is prime: 11
Is prime: 13
Is prime: 17
Is prime: 19
Is prime: 23
Is prime: 29
Is prime: 31
Is prime: 37
Is prime: 41
Is prime: 43
Is prime: 47
Is prime: 53
Is prime: 59
Is prime: 61
Is prime: 67
Is prime: 71
Is prime: 73
Is prime: 79
Is prime: 83
Is prime: 89
Is prime: 97