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

建议使用的浏览器：

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

4322：Candy

题目描述
There are N candies and M kids, the teacher will give this N candies to the M kids. The i-th kids for the j-th candy has a preference for like[i][j], if he like the sugar, like[i][j] = 1, otherwise like[i][j] = 0. If the i-th kids get the candy which he like he will get K glad value. If he or she do not like it. He will get only one glad value. We know that the i-th kids will feel happy if he the sum of glad values is equal or greater than B[i]. Can you tell me whether reasonable allocate this N candies, make every kid feel happy.
输入解释
The Input consists of several cases .The first line contains a single integer t .the number of test cases.
For each case starts with a line containing three integers N, M, K (1<=N<=13, 1<=M<=13, 2<=K<=10)
The next line contains M numbers which is B[i](0<=B[i]<=1000). Separated by a single space.
Then there are M*N like[i][j] , if the i-th kids like the j-th sugar like[i][j]=1 ,or like[i][j]=0.
输出解释
If there have a reasonable allocate make every kid feel happy, output "YES", or "NO".
输入样例 
2
3 2 2
2 2
0 0 0
0 0 1

3 2 2
2 2
0 0 0
0 0 0
输出样例 
Case #1: YES
Case #2: NO
提示
Give the first and second candy to the first kid.
Give the third candy to the second kid.
This allocate make all kids happy.
来自杭电HDUOJ的附加信息
Author BJTU
Recommend zhoujiaqi2010
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2012 Multi-University Training Contest 3
源链接： HDU-4322
最后修改于 2020-10-25T23:12:24+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
4000/2000MS(Java/Others) 65536/65536K(Java/Others)