筛质数+完全背包
#include <iostream>
using namespace std;
typedef long long LL;
const int N = 1010;
int n;
int primes[N], cnt;
bool st[N];
LL f[N];
void get_primes()//线性筛
{
for (int i = 2; i <= n; i ++ )
{
if (!st[i]) primes[cnt ++ ] = i;
for (int j = 0; primes[j] <= n / i; j ++ )
{
st[primes[j] * i] = true;
if (i % primes[j] == 0) break;
}
}
}
int main()
{
cin >> n;
get_primes();
f[0] = 1;
for (int i = 0; i < cnt; i ++ )
for (int j = primes[i]; j <= n; j ++ )
f[j] = f[j] + f[j - primes[i]];
printf("%lld\n", f[n]);
return 0;
}