有关计数问题的DP 划分数

#include <cstdio>
#include <algorithm>
using namespace std;

int n, m, M;
int dp[1000][1000];

void solve()
{
dp[0][0] = 1;
for (int i = 1; i <= m; i++){
for (int j = 0; j <= n; j++){
if (j - i >= 0){
dp[i][j] = (dp[i - 1][j] + dp[i][j - i]) % M;
}
else{
dp[i][j] = dp[i - 1][j];
}
}
}
printf("%d\n", dp[m]
);
}

int main()
{
while (scanf("%d%d%d", &m, &n, &M) != EOF){
solve();
}
return 0;
}