Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int n,c=0,i;
- bool isp[1000001];
- int maxN=1000001;
- for( i=4;i<maxN;i+=2)
- {
- isp[i]=1;
- }
- for( i=3;i*i<maxN;i=i+2)
- {
- if(isp[i]==0)
- {
- for(int j=i*i;j<maxN;j+=i+i)
- {
- isp[j]=1;
- }
- }
- }
- isp[0]=isp[1]=1;
- while(1)
- {
- c=0;
- cin>>n;
- if(n==0)
- {
- return 0;
- }
- else if(n>3)
- {
- if(isp[n-2]==0)
- {
- cout<<n<<":\n"<<2<<"+"<<n-2<<endl;
- c++;
- }
- for(i=3;i<=n/2;i=i+2)
- {
- if(isp[n-i]==0 && isp[i]==0)
- {
- cout<<n<<":\n"<<i<<"+"<<n-i<<endl;
- c++;
- break;
- }
- }
- if(c==0)
- {
- cout<<"NO WAY!"<<endl;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement