当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5616：Jam's balance

题目描述
Jim has a balance and N weights. $(1 \leq N \leq 20)$
The balance can only tell whether things on different side are the same weight.
Weights can be put on left side or right side arbitrarily.
Please tell whether the balance can measure an object of weight M.
输入解释
The first line is a integer $T(1 \leq T \leq 5)$, means T test cases.
For each test case :
The first line is $N$, means the number of weights.
The second line are $N$ number, i'th number $w_i (1 \leq w_i \leq 100)$ means the i'th weight's weight is $w_i$.
The third line is a number $M$. $M$ is the weight of the object being measured.
输出解释
You should output the "YES"or"NO".
输入样例 
1
2
1 4
3
2
4
5
输出样例 
NO
YES
YES
提示
For the Case 1:Put the 4 weight alone
For the Case 2:Put the 4 weight and 1 weight on both side
来自杭电HDUOJ的附加信息
Recommend hujie
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 BestCoder Round #70
源链接： HDU-5616
最后修改于 2020-10-25T23:24:14+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)