这里就是01背包多了一维物品个数罢了
记得不能重复所以有一层循环顺序要倒着来
边界f[0][0] = 1
#include<cstdio>
#include<vector>
#include<cstring>
#define REP(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;const int MAXN = 1121;
bool is_prime[MAXN];
vector<int> prime;
int f[MAXN][20];void init()
{memset(is_prime, true, sizeof(is_prime));is_prime[0] = is_prime[1] = false;REP(i, 2, MAXN){if(is_prime[i]) prime.push_back(i);REP(j, 0, prime.size()){if(i * prime[j] >= MAXN) break;is_prime[i * prime[j]] = false;if(i % prime[j] == 0) break;}}
}int main()
{init();f[0][0] = 1;REP(i, 0, prime.size())for(int n = MAXN; n >= prime[i]; n--)REP(k, 1, 15)f[n][k] += f[n - prime[i]][k-1];int n, k;while(~scanf("%d%d", &n, &k) &&n)printf("%d\n", f[n][k]);return 0;
}