Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <algorithm>
- #include <iostream>
- #include <cmath>
- #include <cstring>
- #include <vector>
- using namespace std;
- int main(){
- //freopen("input.txt","r",stdin);
- long long dp[900];
- vector<int> prime;
- bool fl[400];
- memset(fl,true,sizeof(fl));
- memset(dp,0,sizeof(dp));
- fl[1]=false;
- for(int i=2;i<350;i++)
- for(int j=2*i;j<350;j+=i)
- fl[j]=false;
- for(int i=1;i<350;i++)
- if(fl[i])
- prime.push_back(i);
- dp[0]=1;
- for(int i=0;i<prime.size();i++){
- for(int j=0;j<350;j++){
- dp[prime[i]+j]+=dp[j];
- }
- }
- int n;
- while(scanf("%d",&n)==1)
- printf("%lld\n",dp[n]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement