24 Point game
-
描述
-
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
来源
- 经典改编 上传者
题意很简单,C组数据,每组数据有一个M,一个N。M代表有M个数,你可以对这M个数任选两个进行加减乘除,最后得到一个结果。如果结果能得到N,输出Yes,否则No。
因为数据比较小直接暴力dfs即可。(PS:只会这一个方法),先从M个数中任选一个(每个数都选一次),标记为s,然后从剩下的数中逐个枚举,分别进行加减乘除。比较最终结果即可。
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #include <cmath> #define mv(a,b) memset(a,b,sizeof(a)) using namespace std; int n; int ans; double a[10]; bool flag; bool vis[10]; void dfs(double s,int cnt) { if(cnt==n) //n个数,代表只能进行n次操作 { if(fabs(s-ans)<0.0000001) //运算过程中可能会有小数出现,所以需要处理精度的问题 { flag=true; return ; } } for(int i=1; i<=n; i++) { if(!vis[i]) { vis[i]=true; //标记,避免重复 cnt++; dfs(s+a[i],cnt); // 加减乘除 dfs(s-a[i],cnt); dfs(s*a[i],cnt); dfs(s/a[i],cnt); dfs(a[i]/s,cnt); dfs(a[i]-s,cnt); vis[i]=false; // 回溯 cnt--; } } } int main() { int T; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&ans); for(int i=1; i<=n; i++) { scanf("%lf",&a[i]); } flag=false; // 标记是否找到 for(int i=1; i<=n; i++) { if(flag) break; else { mv(vis,false); vis[i]=true; dfs(a[i],1); } } if(flag) cout<<"Yes"<<endl; else cout<<"No"<<endl; } }
-
The input has multicases and each case contains one line