Healthy Holsteins

Problem:
Healthy Holsteins

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.

PROGRAM NAME: holstein

INPUT FORMAT

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.

SAMPLE INPUT (file holstein.in)

4
100 200 300 400
3
50   50  50  50
200 300 200 300
900 150 389 399

OUTPUT FORMAT

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

If more than one set of feedtypes yield a minimum of scoops, choose the set with the smallest feedtype numbers.

SAMPLE OUTPUT (file holstein.out)

2 1 3

____________________________________________________________________________________________________________________________________

My Answer:

/*
ID:iby071
LANG:C++
TASK:holstein
*/

#include<iostream>
#include<fstream>
using namespace std;

int v,g,minimum=16;
int *need,*current,*solve,*best,**feed;

void dfs(int depth,int cnt)
{	if(depth==g)				
	{	for(int i=0;i<v;++i)
			if(current[i]<need[i]) return;
		if(cnt<minimum)
		{	minimum=cnt;
			for(int i=0;i<minimum;++i)
				best[i]=solve[i];
		}
		return;
	}
	for (int i=0;i<v;i++)
         current[i]+=feed[depth][i];
    solve[cnt]=depth;
	dfs(depth+1,cnt+1);					//向下探索
    for (int i=0;i<v;i++)				//回溯到进入depth探索之前
        current[i]-=feed[depth][i];
    dfs(depth+1,cnt);					//进行跳过depth，对depth+1的探索
}

int main()
{	ifstream fin("holstein.in");
	ofstream fout("holstein.out");
	
	fin>>v;
	need=new int[v];
	current=new int[v];
	for(int i=0;i<v;++i) {fin>>need[i];current[i]=0;}
	fin>>g;
	feed=new int*[g];
	solve=new int[g];
	best=new int[g];
	for(int i=0;i<g;++i)
		feed[i]=new int[v];
	for(int i=0;i<g;++i)
		for(int j=0;j<v;++j)
			fin>>feed[i][j];

	dfs(0,0);
	
	fout<<minimum;
	for(int i=0;i<minimum;++i)
		fout<<' '<<best[i]+1;
	fout<<endl;

	return 0;
}