背包问题之摆花

题述

输入输出

样例

代码

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 110;

int n, m;
int f[N];

int main()
{
    
    
    cin >> n >> m;

    f[0] = 1;
    for (int i = 0; i < n; i ++ )
    {
        int a;
        cin >> a;
        for (int j = m; j >= 0; j -- )
            for (int k = 1; k <= j && k <= a; k ++ )
                f[j] = (f[j] + f[j - k]) % 1000007;
    }

    cout << f[m] << endl;

    return 0;
}