#include<stdio.h>
#include<cstdlib>
#include<cstring>
#include<cmath>
#define eps 1e-6
//抽象搜索的经典题
using namespace std;
int N;
double num[10],value;
bool judge(double a,double b)//双浮点数字判断相等 常用 应该记住
{
if(fabs(a-b)<eps)
return true;
return false;
}
bool dfs(int k)
{
if(k==N)//用上了所有数字
{
if(judge(value,num[N]))//最终得到目标值
return true;
return false;
}
for(int i=k;i<N;i++)//枚举N个数进行+-*/运算将运算的结果保存在数组里即可模拟枚举出()运算
{
for(int j=i+1;j<=N;j++)
{
double a=num[i],b=num[j];
num[i]=num[k];
num[j]=a+b;if(dfs(k+1))return true;
num[j]=a-b;if(dfs(k+1))return true;
num[j]=b-a;if(dfs(k+1))return true;
num[j]=a*b;if(dfs(k+1))return true;
if(!judge(a,0))//避免除零错误
{
num[j]=b/a;if(dfs(k+1))return true;
}
if(!judge(b,0))//避免除零错误
{
num[j]=a/b;if(dfs(k+1))return true;
}
num[i]=a;
num[j]=b;
}
}
return false;
}
int main()
{
int t,i,j;
scanf("%d",&t);
while(t--)
{
scanf("%d%lf",&N,&value);
for(i=1;i<=N;++i)
{
scanf("%lf",&num[i]);
}
if(dfs(1))
printf("Yes\n");
else
printf("No\n");
}
return 0;
}
#include<cstdlib>
#include<cstring>
#include<cmath>
#define eps 1e-6
//抽象搜索的经典题
using namespace std;
int N;
double num[10],value;
bool judge(double a,double b)//双浮点数字判断相等 常用 应该记住
{
if(fabs(a-b)<eps)
return true;
return false;
}
bool dfs(int k)
{
if(k==N)//用上了所有数字
{
if(judge(value,num[N]))//最终得到目标值
return true;
return false;
}
for(int i=k;i<N;i++)//枚举N个数进行+-*/运算将运算的结果保存在数组里即可模拟枚举出()运算
{
for(int j=i+1;j<=N;j++)
{
double a=num[i],b=num[j];
num[i]=num[k];
num[j]=a+b;if(dfs(k+1))return true;
num[j]=a-b;if(dfs(k+1))return true;
num[j]=b-a;if(dfs(k+1))return true;
num[j]=a*b;if(dfs(k+1))return true;
if(!judge(a,0))//避免除零错误
{
num[j]=b/a;if(dfs(k+1))return true;
}
if(!judge(b,0))//避免除零错误
{
num[j]=a/b;if(dfs(k+1))return true;
}
num[i]=a;
num[j]=b;
}
}
return false;
}
int main()
{
int t,i,j;
scanf("%d",&t);
while(t--)
{
scanf("%d%lf",&N,&value);
for(i=1;i<=N;++i)
{
scanf("%lf",&num[i]);
}
if(dfs(1))
printf("Yes\n");
else
printf("No\n");
}
return 0;
}