NYOJ 43 24 Point game （DFS）

• 题目43
• 题目信息
• 运行结果
• 本题排行
• 讨论区

24 Point game

时间限制： 3000 ms  |  内存限制： 65535 KB

难度： 5

描述

There is a game which is called 24 Point game.

In this game , you will be given some numbers. Your task is to find an expression which have all the given numbers and the value of the expression should be 24 .The expression mustn't have any other operator except plus,minus,multiply,divide and the brackets. 

e.g. If the numbers you are given is "3 3 8 8", you can give "8/(3-8/3)" as an answer. All the numbers should be used and the bracktes can be nested. 

Your task in this problem is only to judge whether the given numbers can be used to find a expression whose value is the given number。

输入

The input has multicases and each case contains one line
The first line of the input is an non-negative integer C(C<=100),which indicates the number of the cases.
Each line has some integers,the first integer M(0<=M<=5) is the total number of the given numbers to consist the expression,the second integers N(0<=N<=100) is the number which the value of the expression should be.
Then,the followed M integer is the given numbers. All the given numbers is non-negative and less than 100

输出

For each test-cases,output "Yes" if there is an expression which fit all the demands,otherwise output "No" instead.

样例输入

2
4 24 3 3 8 8
3 24 8 3 3

样例输出

Yes
No

题意：该题也是通过经典的24点改编的，就是给你几个数要通过 + - * / 这几个运算后（中间可以加括号），可不可以得出结果24

24点在编程之美上也有介绍，应该是出自微软面试题

该题的思路就是通过深搜枚举各种可能性。

#include <iostream>
#include <cmath>
using namespace std;
const int maxn = 10;
const double e = 1e-6;
int T, m;
double n;
double num[maxn];

bool dfs(int t)
{
    if (t == m){
        if (fabs(n - num[m]) < e)
            return true;
        return false;
    }
    double left, right;
    for (int i = t; i < m; i++){
        for (int j = i + 1; j <= m; j++){
            left = num[i];
            right = num[j];
            num[i] = num[t];
            num[j] = left + right;
            if (dfs(t + 1))
                return true;
            num[j] = left - right;
            if (dfs(t + 1))
                return true;
            num[j] = right - left;
            if (dfs(t + 1))
                return true;
            num[j] = left * right;
            if (dfs(t + 1))
                return true;
            if (left != 0){
                num[j] = right / left;
                if (dfs(t + 1))
                    return true;
            }
            if (right != 0){
                num[j] = left / right;
                if (dfs(t + 1))
                    return true;
            }
            num[i] = left;
            num[j] = right;
        }
    }
    return false;
}

int main()
{
    cin >> T;
    while (T--){
        cin >> m >> n;
        for (int i = 1; i <= m; i++)
            cin >> num[i];
        if (dfs(1))
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    return 0;
}