分組背包-ACboy needs your help

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.

same input 

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

output 

3 4 6

#include<string.h>#include<stdio.h>int main(){    int a[105][105],f[105];  int i,j,n,m,v;  while(scanf("%d%d",&n,&m),n|m)   {    for(i=1;i<=n;i++)     for(j=1;j<=m;j++)      scanf("%d",&a[i][j]);     memset(f,0,sizeof(f));     for(i=1;i<=n;i++)                     //從n個課程裡選擇。      for(j=m;j>=0;j--)                    //剩下的天數       for(v=1;v<=j;v++)                   //從每組裡選擇。        f[j]=f[j]>f[j-v]+a[i][v]?f[j]:f[j-v]+a[i][v];     printf("%d\n", f[m]);         }   return 0;}