题目链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=43
思路是模仿别人的。
思路:每次从数组中选出来两个数,做完四则运算在放回去,直到剩最后一个数,和给定的值比较。
代码:
#include <cstdio>
#include <cmath>
double number[10];
int m,n;
bool dfs(int ending)
{
if(ending == 0)
return false;
if(ending == 1)
{
if(fabs(number[0] - n) < 1e-6)
return true;
else
return false;
}
for(int i = 0; i < ending; ++i)
{
for(int j = i + 1; j < ending; ++j)
{
double a = number[i];
double b = number[j];
number[j] = number[ending - 1];
number[i] = a + b;
if(dfs(ending - 1))
return true;
number[i] = a - b;
if(dfs(ending - 1))
return true;
number[i] = b - a;
if(dfs(ending - 1))
return true;
number[i] = a * b;
if(dfs(ending - 1))
return true;
if(b != 0)
{
number[i] = a / b;
if(dfs(ending - 1))
return true;
}
if(a != 0)
{
number[i] = b / a;
if(dfs(ending - 1))
return true;
}
number[i] = a;
number[j] = b;
}
}
return false;
}
int main()
{
int _;
scanf("%d",&_);
{
while(_--)
{
scanf("%d%d",&m,&n);
for(int i = 0; i < m; ++i)
scanf("%lf",&number[i]);
if(dfs(m))
printf("Yes\n");
else
printf("No\n");
}
}
}