中国梦 题解

题目在主页，如有出错请指出

include <bits/stdc++.h>

using namespace std;

int f[15][305];
int v[15];

int main()
{
int n, k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; i++)
scanf("%d", &v[i]);
f[0][0] = 1;
for (int i = 1; i <= n; i++)
f[0][i] = 0;
for (int i = 1; i <= k; i++)
{
for (int j = 0; j <= n; j++)
{
f[i][j] = f[i - 1][j];
if (j >= v[i]) f[i][j] += f[i][j - v[i]];
}
}
cout << f[k][n] << endl;
return 0;
}