AcWing 1021. 货币系统（完全背包求方案数）

题目链接：点击这里

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;
typedef long long ll;
const int N = 3010;

ll f[N];

int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    
    f[0] = 1;
    for(int i = 1; i <= n; ++i)
    {
        int a;
        scanf("%d", &a);
        
        for(int j = a; j <= m; ++j)
            f[j] += f[j - a];
    }
    
    printf("%lld\n", f[m]);
    
    return 0;
}