Guest User

Untitled

a guest
Jan 18th, 2017
64
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.80 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. #include <stdio.h>
  4. int is_prime(int number) {
  5. for (int i = 2; i <= number / 2; i++) {
  6. if (number %i == 0) {
  7. return 0;
  8. }
  9. }
  10. return 1;
  11. }
  12.  
  13.  
  14. int random(int start, int end) {
  15. return rand() % (end - start) + start;
  16. }
  17.  
  18. int nearest_prime(int number) {
  19. for (int i = 0; i < number; i++) {
  20. if (is_prime(number - i)) {
  21. return number - i;
  22. }
  23. }
  24.  
  25. return 0;
  26. }
  27.  
  28. int next_prime(int number) {
  29. for (int i = 0; ; i++) {
  30. if (is_prime(number + i)) {
  31. return number + i;
  32. }
  33. }
  34. return 0;
  35. }
  36.  
  37. main() {
  38.  
  39. for (int i = 0; i < 100; i++) {
  40. int r = random(50, 100);
  41. int pp = nearest_prime(r);
  42. int np = next_prime(r);
  43.  
  44. int rpp = r - pp;
  45. int npp = np - r;
  46.  
  47. if (rpp > npp) {
  48. printf("%d - %d - %d\n", r, npp, npp );
  49. }
  50. else {
  51. printf("%d - %d - %d\n", r, rpp, pp);
  52. }
  53.  
  54.  
  55. }
  56. getchar();
  57. }
Add Comment
Please, Sign In to add comment