UVA 10943 How do you add?——背包

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 1e6;
const int maxn = 105;
int n, m, dp[maxn][maxn];
void init() {
    dp[0][0] = 1;
    for (int i = 1; i <= 100; i++) {
        for (int j = 0; j <= 100; j++) {
            for (int k = 0; k <= j; k++) {
                dp[i][j] = (dp[i][j] + dp[i-1][j-k]) % mod;
            }
        }
    }
}
int main() {
    init();
    while (~scanf("%d %d", &n, &m) && n && m) printf("%d\n", dp[m][n]);
    return 0;
}