Guest User

Untitled

a guest
May 16th, 2018
717
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.95 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int main()
  5. {
  6. int i, N = 1000, l = 0;
  7. int a[N], primeArr[l];
  8.  
  9. printf("Array of numbers: \n");
  10. for (i = 0; i < N; i++)
  11. {
  12. a[i] = rand();
  13. printf("%d ", a[i]);
  14. }
  15.  
  16. printf("\n\n");
  17.  
  18. printf("Array of prime numbers: \n");
  19. for (i = 0; i < N; i++)
  20. {
  21. int k, numDivisor = 0;
  22. for (k = 1; k <= a[i]; k++)
  23. if (a[i] % k == 0)
  24. numDivisor++;
  25. if (numDivisor == 2)
  26. {
  27. primeArr[l] = a[i];
  28. printf("%d ", primeArr[l]);
  29. l++;
  30. }
  31. }
  32.  
  33. printf("\n\n");
  34.  
  35. if(l > 0)
  36. {
  37. printf("Max prime numbers: \n");
  38. int max = primeArr[0];
  39. for (i = 1; i < l; i++)
  40. {
  41. if (primeArr[i] >= max)
  42. max = primeArr[i];
  43. }
  44. printf("%d", max);
  45. return 0;
  46. }
  47. else
  48. return -1;
  49. }
Advertisement
Add Comment
Please, Sign In to add comment