hdu5339&bestcoder（#49）a题

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
const int maxn=20+5;
int b[maxn],t,n,a;
int ans;
int cmp(int a,int b)
{
        return a>b;
}
void  solve(int num,int cnt,int s)
{
        if(num>n)   return;
        int tmp;
        tmp=s%b[num];
        if(cnt>ans) return;
        if(tmp==0)  {ans=min(ans,cnt+1);return;}
       // cout<<num<<" "<<cnt<<" "<<s<<" "<<tmp<<endl;
        solve(num+1,cnt+1,tmp);
        solve(num+1,cnt,s);
}

int main()
{
        scanf("%d",&t);
        while(t--)
        {
                ans=(1<<30);
                scanf("%d%d",&n,&a);
                for(int i=1;i<=n;i++)
                        scanf("%d",b+i);
                sort(b+1,b+n+1,cmp);
                solve(1,0,a);
                if(ans!=(1<<30))  printf("%d\n",ans);
                else printf("-1\n");
        }
}