#include <iostream>
using namespace std;
const int N = 110, mod = 1e6 + 7;
int n, m;
int a[N];
int f[N][N];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ ) cin >> a[i];
f[0][0] = 1;
for (int i = 1; i <= n; i ++ )
for (int j = 0; j <= m; j ++ )
for (int k = 0; k <= a[i]; k ++ )
if (j >= k)
f[i][j] = (f[i][j] + f[i - 1][j - k]) % mod;
cout << f[n][m] << endl;
}
【多重背包】NOIP2012——摆花
最新推荐文章于 2024-09-12 19:02:20 发布