# hdu 1712 ACboy needs your help

hdu 1712 ACboy needs your help

# ACboy needs your help

##### Total Submission(s) : 158   Accepted Submission(s) : 74
Problem Description
ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrange the M days for the N courses to maximize the profit?

Input
The input consists of multiple data sets. A data set starts with a line containing two positive integers N and M, N is the number of courses, M is the days ACboy has.

Next follow a matrix A[i][j], (1<=i<=N<=100,1<=j<=M<=100).A[i][j] indicates if ACboy spend j days on ith course he will get profit of value A[i][j].

N = 0 and M = 0 ends the input.

Output
For each data set, your program should output a line which contains the number of the max profit ACboy will gain.

Sample Input
```

2 2
1 2
1 3
2 2
2 1
2 1
2 3
3 2 1
3 2 1
0 0

```

Sample Output
```

3
4
6

```

Source
HDU 2007-Spring Programming Contest

``````#include<stdio.h>
#include<string.h>
int wi;   //作用值
int vi;   //所花天数
int xx;
int n,m;
int f;
int package()   //背包模版
{
for(int i=0;i<=m;i++)
f[i]=0;
for(int j=0;j<n;j++)
{
for(int h=m;h>=0;h--)
{
for(int i=0;i<m;i++)
{
if(h-vi[j][i]>=0)
f[h]=f[h]>f[h-vi[j][i]]+wi[j][i]?f[h]:f[h-vi[j][i]]+wi[j][i];
}
}
}
return f[m];
}
int main()
{
int i,j;
int ans;
while(scanf("%d%d",&n,&m)&&m&&n)
{
memset(vi,0,sizeof(vi));
memset(wi,0,sizeof(wi));
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
vi[i][j]=j+1;
scanf("%d",&wi[i][j]);
}
}
ans=package();
printf("%d\n",ans);
}
return 0;
}`````` 