题目43:24 Point game
来源:互联网 发布:调度数据网络交流 编辑:程序博客网 时间:2024/06/12 13:43
题目链接:
http://acm.nyist.net/JudgeOnline/problem.php?pid=43
描述
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 8
3 24 8 3 3
样例输出
YesNo
算法思想:
这是一道经典的深度搜索的题目,使用深度搜索来模拟所有的括号和加减乘除。
源代码
#include<stdio.h>#include<string.h>#include<math.h>int n, vis[10];int flag;double a[10], aim;void dfs(double num);int main(){ int t; scanf("%d", &t); while (t--) { flag = 0; scanf("%d%lf", &n, &aim); for (int i = 0; i<n; i++) scanf("%lf", &a[i]); for (int i = 0; i<n; i++) { memset(vis, 0, sizeof(vis)); vis[i] = 1; dfs(a[i]); if (flag) { break; } } if (flag) printf("Yes\n"); else printf("No\n"); } return 0;}void dfs(double sum){ int cnt = 0; for (int i = 0; i<n; i++) if (vis[i]) cnt++; if (cnt == n) { if (fabs(aim - sum)<0.0000001) flag = 1; return; } for (int i = 0; i<n; i++) { if (!vis[i] && !flag) { vis[i] = 1; dfs(a[i] + sum); dfs(a[i] - sum); dfs(a[i] * sum); dfs(sum - a[i]); if (a[i] != 0.0) dfs(sum / a[i]); if (sum != 0.0) dfs(a[i] / sum); vis[i] = 0; } }}
- 题目43:24 Point game
- OJ题目43 24 Point game(dfs)
- Nyoj 43 24 Point game
- NYOJ-43 24 Point game
- 24 Point game(nyoj 43)
- nyoj 43 24 Point game
- oyoj-43 24 Point game
- NYOJ 43 24 Point game
- nyoj-43 24 Point game (搜索)
- NYOJ-43 24 Point game-DFS
- Nyoj 43 24 Point game 【DFS】
- NYOJ 43--24 Point game【DFS】
- 深搜 nyoj 43 24 Point game
- 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
- Cron表达式构成
- 一张图让你彻底学懂java中try_catch_finally语句的流程走向
- linux操作oracle
- Oracle 12c R2版本 Application Containers 特性(二)
- 大数据初学者怎样学习?
- 题目43:24 Point game
- learn python第七章:面向对象编程 (第一节:类)
- CVPixelBufferRef与UIImage的互相转换
- 新路程------hi3516a gpio1_2设置双边触发失败
- 用批处理命令,如何删除目录下的文件夹、文件,而不影响目录
- linux 下 Nginx 0.8.40的安装
- 如何解决 Linux 虚拟机磁盘设备名不一致的问题
- /proc 系统参数
- 1.2冯诺依曼计算机