Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- #define x 1000000
- bool mark[x+5]={false};
- void sieve()
- {
- int i,j,k=0,isprime[10000];
- mark[0]=true;
- mark[1]=true;
- for(i=2;i*i<=1000000;i++)
- {
- if(mark[i]==false)
- {
- for(j=i*i;j<=1000000;j+=i)
- {
- mark[j]=true;
- }
- }
- }
- }
- int main()
- {
- sieve();
- long long int n,i,j,k,a,b,c,d,e,f;
- while(cin>>n && n)
- {
- int flag=0;
- cout<<n<<":"<<endl;
- for(i=2;i<=(n/2);i++)
- {
- if(mark[i]==false)
- {
- a=n-i;
- if(mark[a]==false)
- {
- cout<<i<<"+"<<a<<endl;
- flag=1;
- break;
- }
- }
- }
- if(flag==0)
- cout<<"NO WAY!"<<endl;
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment