Pro.ID10131 TitleHealthy Holsteins Title链接http://10.20.2.8/oj/exercise/problem?problem_id=10131 AC44 Submit182 Ratio24.18% 时间&空间限制描述Farmer John prides himself on having the healthiest dairy cows in the world. He knows the vitamin content for one scoop of each feed type and the minimum daily vitamin requirement for the cows. Help Farmer John feed his cows so they stay healthy while minimizing the number of scoops that a cow is fed. Given the daily requirements of each kind of vitamin that a cow needs, identify the smallest combination of scoops of feed a cow can be fed in order to meet at least the minimum vitamin requirements. Vitamins are measured in integer units. Cows can be fed at most one scoop of any feed type. It is guaranteed that a solution exists for all contest input data. 输入Multiple test cases. For each case: Line 1: integer V ( 1 ≤ V ≤ 25 ), the number of types of vitamins Line 2: V integers ( 1 ≤ each one ≤ 1000 ), the minimum requirement for each of the V vitamins that a cow requires each day Line 3: integer G ( 1 ≤ G ≤ 15 ), the number of types of feeds available Lines 4..G+3: V integers ( 0 ≤ each one ≤ 1000 ), the amount of each vitamin that one scoop of this feed contains. The first line of these G lines describes feed #1; the second line describes feed #2; and so on. 输出Description Farmer John prides himself on having the healthiest dairy cows in the world. He knows the vitamin content for one scoop of each feed type and the minimum daily vitamin requirement for the cows. Help Farmer John feed his cows so they stay healthy while minimizing the number of scoops that a cow is fed. Given the daily requirements of each kind of vitamin that a cow needs, identify the smallest combination of scoops of feed a cow can be fed in order to meet at least the minimum vitamin requirements. Vitamins are measured in integer units. Cows can be fed at most one scoop of any feed type. It is guaranteed that a solution exists for all contest input data. Input Multiple test cases. For each case: Line 1: integer V ( 1 ≤ V ≤ 25 ), the number of types of vitamins Line 2: V integers ( 1 ≤ each one ≤ 1000 ), the minimum requirement for each of the V vitamins that a cow requires each day Line 3: integer G ( 1 ≤ G ≤ 15 ), the number of types of feeds available Lines 4..G+3: V integers ( 0 ≤ each one ≤ 1000 ), the amount of each vitamin that one scoop of this feed contains. The first line of these G lines describes feed #1; the second line describes feed #2; and so on. Output For each case, the output is a single line of output that contains:
If more than one set of feedtypes yield a minimum of scoops, choose the set with the smallest feedtype numbers. Sample Input 4 Sample Output 2 1 3 Source 样例输入4 样例输出2 1 3 作者 |