hdu1712ACboy needs your help

ACboy needs your help
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6527 Accepted Submission(s): 3610

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
题意：M天里怎么分配给n节课才能得到最大的获取
分组背包问题
公式：for(i=1~n)
for(j=max~1)
for(k=1~m)
dp[j]=max(dp[j],dp[j-k]+map[i][k]);

#include <cstring>
#include <cstdio>
#include <algorithm>
#include <iostream>
#define N 110
using namespace std;
int dp[N];
int a[N][N];
int n,m;
int main()
{

    while(scanf("%d%d",&n,&m)!=EOF&&n+m)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
        {
            for(int j=N;j>=1;j--)//容量
            {
                for(int k=1;k<=m;k++)
                {
                    if(j>=k)
                    {
                        dp[j]=max(dp[j],dp[j-k]+a[i][k]);
                    }
                }
            }
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}