0%
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
|
#include <iostream> #include <algorithm> using namespace std; typedef long long ll;
int v, n, a[26]; ll f[10005];
int main() { cin >> v >> n; for (int i = 1; i <= v; i++) cin >> a[i];
f[0] = 1; for (int i = 1; i <= v; i++) { for (int j = a[i]; j <= n; j++) { f[j] += f[j-a[i]]; } }
cout << f[n] << endl; return 0; }
|