Healthy Holsteins
시간 제한1초메모리 제한1024 MB
여러 사료의 비타민 함량이 주어질 때, 모든 일일 최소 요구량을 충족하는 가장 적은 수의 사료 조합을 찾고 그 사료 번호를 출력한다.
문제
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. Your goal is to 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.
입력
- 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.
출력
The output is a single line of output that contains:
- the minimum number of scoops a cow must eat, followed by:
- a SORTED list (from smallest to largest) of the feed types the cow is given