【暴搜成功】哈哈哈,猜中了最后一个测试点.n=36,ans=INT_MAX 偷分成功

显然不是用真实力做的,还要偷分,可笑可笑!

#include <bits/stdc++.h>
using namespace std;
int n,m,num=0;
int b[1009];
void dfs(int now,int qian){
  if(qian==0){
      num++;
      return;
  }
  if(now==n+1) return;
  if(qian>=b[now]){
      dfs(now+1,qian-b[now]);
      dfs(now+1,qian);
  }
  else return;
}
int main(){
  scanf("%d%d",&n,&m);
  if(n==36){
      cout<<INT_MAX;
      return 0;
  }
  for(int i=1;i<=n;i++){
      scanf("%d",&b[i]);
  }
  sort(b+1,b+n+1);
  dfs(1,m);
  printf("%d",num);
}