Guest User

Untitled

a guest
Jul 20th, 2018
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.53 KB | None | 0 0
  1. #include<stdio.h>
  2. int prime(int n)
  3. {
  4. int i;
  5. if(n==1)return 1;
  6. if(n==2)return 1;
  7. if(n%2==0)return 0;
  8. for(i=3;i*i<=n;i+=2)
  9. {
  10. if(n%i==0)return 0;
  11.  
  12. }
  13. return 1;
  14. }
  15. int main()
  16. {
  17. int n,res1,res2,i,j,k,l,p;
  18. while(1)
  19. {
  20. i=3;
  21. l=0;
  22. scanf("%d",&n);
  23. if(n==EOF)break;
  24. while(1)
  25. {
  26. p=prime(i);
  27. if(p==1)
  28. {
  29. j=i+2;
  30. k=prime(j);
  31. if(k==1)
  32. {
  33. l++;
  34. res1=i;
  35. res2=j;
  36. }
  37. }
  38. if(l==n)
  39. {
  40. break;
  41. }
  42. i++;
  43. }
  44. printf("(%d, %d)\n",res1,res2);
  45. }
  46. }
Add Comment
Please, Sign In to add comment