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
題目大意：
先輸入n，m代表n個課程和有m天，在輸入n*m的矩陣，分別代表經歷j天在i課程上，得到的一個權值，求大的權值。

#include <iostream>
#include <cstring>
using
 
 namespace std;
int a[105][105],dp[105];
int n,m;
int main()
{
    while(cin>>n>>m,n||m)
    {
        memset(dp,0,sizeof dp);
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                cin>>a[i][j];
        for(int i=1;i<=n;i++)
            for(int j=m;j>=1
 
;j--)
                for(int k=1;k<=j;k++)///枚舉在i課程的天數
                    dp[j]=max(dp[j],dp[j-k]+a[i][k]);
        cout<<dp[m]<<‘\n‘;
    }
    return 0;
}

ACboy needs your help（分組背包）