#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn=110;
int a[maxn],s,n,m,p[maxn],ans;
void dfs(int x,int y){
//printf("%d\n",y);
if(y<0)return;
if(y==0){ans++;return;}
for(int i=x;i<=n;i++){
if(!p[i]){
p[i]=1;
dfs(i,y-a[i]);
p[i]=0;
}
}
}
int main(){
int i,j,k;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
}
dfs(1,m);
printf("%d",ans);
return 0;
}
小A点菜(dfs)
最新推荐文章于 2017-10-21 20:25:52 发布