Advertisement
Guest User

Untitled

a guest
Sep 17th, 2019
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.03 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main()
  4. {
  5. int n,c=0,i;
  6. bool isp[1000001];
  7. int maxN=1000001;
  8. for( i=4;i<maxN;i+=2)
  9. {
  10. isp[i]=1;
  11. }
  12. for( i=3;i*i<maxN;i=i+2)
  13. {
  14. if(isp[i]==0)
  15. {
  16. for(int j=i*i;j<maxN;j+=i+i)
  17. {
  18. isp[j]=1;
  19. }
  20. }
  21. }
  22. isp[0]=isp[1]=1;
  23. while(1)
  24. {
  25. c=0;
  26. cin>>n;
  27. if(n==0)
  28. {
  29. return 0;
  30. }
  31. else if(n>3)
  32. {
  33. if(isp[n-2]==0)
  34. {
  35. cout<<n<<":\n"<<2<<"+"<<n-2<<endl;
  36. c++;
  37. }
  38. for(i=3;i<=n/2;i=i+2)
  39. {
  40. if(isp[n-i]==0 && isp[i]==0)
  41. {
  42. cout<<n<<":\n"<<i<<"+"<<n-i<<endl;
  43. c++;
  44. break;
  45. }
  46. }
  47. if(c==0)
  48. {
  49. cout<<"NO WAY!"<<endl;
  50. }
  51. }
  52.  
  53. }
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement