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