zoukankan      html  css  js  c++  java
  • nyoj43 24 Point game 记忆搜索

     

    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
    代码:
    #include<stdio.h>
    #include<math.h>
    const double e = 1e-6; 
    double num[7],v;
    int n;
    bool dfs(int t)
    {
        if(t==n)
        {
            if(fabs(v-num[n])<e)
                return true;
            return false;
        }
    double left,right;
        for(int i=t;i<n;++i)
            for(int j=i+1;j<=n;++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]=left*right;  if(dfs(t+1)) return true;
                num[j]=right-left;  if(dfs(t+1)) return true;
                if(left) 
                    num[j]=right/left; if(dfs(t+1)) return true;
                if(right)
                    num[j]=left/right; if(dfs(t+1)) return  true;
                num[i]=left;//回溯
                num[j]=right;
            }
        return false;
    }
    
    
    
    
    int main()
    {
        int T;
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d%lf",&n,&v);
            for(int i=1;i<=n;++i)
                scanf("%lf",&num[i]);
            if(dfs(1))
                printf("Yes\n");
            else
                printf("No\n");
        }
        return 0;
    }


     

  • 相关阅读:
    20160419—JS备忘:服务器回发刷新页面提示重试的解决方案。
    JS备忘--子父页面获取元素属性、显示时间,iframe之间互相调用函数
    20160215--获取页面的高度和宽度
    20151013--设计模式六大原则(转载)
    20150915--文件下载
    20150909—Win10系统80端口被System占用
    GridView中实现CheckBox的全选
    Invoke和BeginInvoke的区别(转载)
    AJAX+图像验证码(一般处理程序)
    报表
  • 原文地址:https://www.cnblogs.com/zibuyu/p/3106963.html
Copyright © 2011-2022 走看看