24 Point game
阿新 • • 發佈:2017-05-10
line instead som except each value back color int
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
- 來源
- 經典改編
- 上傳者
- 張雲聰
- 第一次由於用了vector數組覆蓋的方法,太蠢了,大量的空間移動和數據拷貝,TLE
- 超時代碼:
-
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include
24 Point game