小A点菜
作者:
logos--
,
2023-08-17 16:23:15
,
所有人可见
,
阅读 105
#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int N = 10010, M = 10010;
constexpr int inf = 1E18, mod = 100003;
int n, m, dp[N], a[N];
inline void Main() {
cin >> n >> m;
for (int i = 1; i <= n; i ++) cin >> a[i];
dp[0] = 1;
for (int i = 1; i <= n; i ++) {
for (int j = m; j >= a[i]; j --) {
dp[j] += dp[j - a[i]];
}
}
cout << dp[m] << '\n';
}
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int T = 1;
while(T --) Main();
return 0;
}