AcWing 278. 数字组合
原题链接
简单
作者:
我叫wys
,
2021-01-26 17:17:12
,
所有人可见
,
阅读 354
我看没人写二维的,我写一下
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110, M = 10010;
int n, m;
int f[N][M];
int main()
{
cin >> n >> m;
for(int i = 0; i <= n; i ++) f[i][0] = 1;
for(int i = 1; i <= n; i ++)
{
int v;
cin >> v;
for(int j = 0; j <= m; j ++)
{
if(v <= j)
f[i][j] = f[i - 1][j] + f[i - 1][j - v];
else f[i][j] = f[i - 1][j];
}
}
cout << f[n][m] << endl;
return 0;
}
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 110, M = 10010;
int n, m;
int f[N][M];
int main()
{
cin >> n >> m;
for(int i = 0; i <= n; i ++) f[i][0] = 1;
for(int i = 1; i <= n; i ++)
{
int v;
cin >> v;
for(int j = 0; j <= m; j ++)
{
f[i][j] = f[i - 1][j];
if(v <= j)
f[i][j] += f[i - 1][j - v];
}
}
cout << f[n][m] << endl;
return 0;
}