rt
My Coding:
#include<bits/stdc++.h>
using namespace std;
int m,n,a[110],ans;
bool b[110];
void search(int q,int s)
{
if(q == 0)
{
ans++;
return ;
}
else if(s == n + 1)
return ;
if(q >= a[s] && b[s] == false)
{
b[s] = true;
search(q-a[s],s+1);
b[s] = false;
search(q,s+1);
}
else
return ;
}
signed main()
{
cin >> n >> m;
for(int i = 1;i <= n;i++)
cin >> a[i];
sort(a+1,a+n+1);
search(m,1);
cout << ans;
return 0;
}