nyoj 43 24 Point game 【dfs&&递归】
来源:互联网 发布:linux入门教程 推荐 编辑:程序博客网 时间:2024/05/21 14:41
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.
- 样例输入
24 24 3 3 8 83 24 8 3 3
- 样例输出
YesNo
- 来源
- 经典改编
- 上传者
- 张云聪
分析:
这道题是一个不错的题,运用深搜加递归,佷6666666666.就是把每一种可能暴力枚举出来 如果能算出24则返回1.
代码:
#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<cmath>#define e 1e-6using namespace std;double num[7],v;int n;int dfs(int t){if(t==n){if(fabs(v-num[n])<e)return 1;return 0;}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 1; num[j]=left-right; if(dfs(t+1)) return 1; num[j]=left*right; if(dfs(t+1)) return 1; num[j]=right-left; if(dfs(t+1)) return true; if(left) num[j]=right/left;if(dfs(t+1)) return 1; if(right) num[j]=left/right; if(dfs(t+1)) return 1; num[i]=left; num[j]=right; } return 0;}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");elseprintf("No\n"); }return 0;}
0 0
- nyoj 43 24 Point game 【dfs&&递归】
- NYOJ-43 24 Point game-DFS
- Nyoj 43 24 Point game 【DFS】
- NYOJ 43--24 Point game【DFS】
- nyoj 43 24 Point game 【经典DFS】
- NYOJ 43 24 Point game (DFS)
- NYOJ 43 24 Point game(dfs)
- Nyoj 24 Point game dfs
- nyoj 24 Point game 43 (dfs) 好题
- Nyoj 43 24 Point game
- NYOJ-43 24 Point game
- 24 Point game(nyoj 43)
- nyoj 43 24 Point game
- NYOJ 43 24 Point game
- nyoj 24 Point game
- nyoj-43 24 Point game (搜索)
- 深搜 nyoj 43 24 Point game
- NYOJ 43 —24 Point game
- 移动web最简洁的滑动效果Swipe JS(适合初学者)
- 版本库控制 - git git git
- 逆波兰运算器浮点求值(c++版本)
- k-means聚类方法的简单java实现
- svn 125005 问题
- nyoj 43 24 Point game 【dfs&&递归】
- Sublime Text3 快捷键
- IBM jni 专栏
- Android动画效果——X、Y轴抖动
- iOS6 创建全局的pch文件
- Android:ListView优化之具有弹性的ListView
- 接口
- 【超级表格创业谱】王庆刚:你的岗位有没有辜负你的才华?
- Android 6.0 Phone 多方通话流程