简单2维背包,统计方案数,无槽点……
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>
using namespace std;
#pragma pack(4)
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x7f7f7f7f;
#define loop(a,n) \
for(int i=0;n>i;i++) \
cout<<a[i]<<(i!=n-1?' ':'\n')
#define loop2(a,n,m) \
for(int i=0;n>i;i++) \
for(int j=0;m>j;j++) \
cout<<a[i][j]<<(j!=m-1?' ':'\n')
#define at(a,i) ((a)&(1<<(i)))
#define nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))
#define cmp(a,b) (fabs((a)-(b))<eps?0:(((a)-(b))>eps?+1:-1))
#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (cmp(a,b)>0?(a):(b))
#define fmin(a,b) (cmp(a,b)<0?(a):(b))
const int MAXV = 32;
const int MAXE = 502;
int tcase,n,m,a[MAXV],dp[MAXV][MAXE];
int main()
{
#ifndef ONLINE_JUDGE
freopen("Buy the souvenirs.txt","r",stdin);
#else
#endif
scanf("%d",&tcase);while(tcase--)
{
scanf("%d %d",&n,&m);
for(int i=0;n>i;i++)
{
scanf("%d",&a[i]);
}
memset(dp,0,sizeof(dp)); dp[0][0]=1;
for(int i=0;n>i;i++)
{
for(int j=n;j>=1;j--)
{
for(int k=m;k>=a[i];k--)
{
if(dp[j-1][k-a[i]]!=-1)
dp[j][k]+=dp[j-1][k-a[i]];
}
}
}
bool flag=false;
for(int i=n;i>0;i--)
{
int cnt=0;
for(int j=0;m>=j;j++)
cnt+=dp[i][j];
if(cnt)
{
printf("You have %d selection(s) to buy with %d kind(s) of souvenirs.\n",cnt,i);
flag=true;
break;
}
}
if(!flag) printf("Sorry, you can't buy anything.\n");
}
return 0;
}