HDU 1723 (Simple DP)

Test instructions: From the 1th person to send the letter to the nth person, each person at most back to the M-person, ask how many kinds of programs to the nth person.

Problem-solving ideas: Water problem, dp[i] means to the first person how many kinds of programs, dp[i] + = Dp[k], i-m <= K < I

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int MAXN =;
int n,m,dp[maxn<<1];

int main ()
{
	while (CIN >> n >> m)
	{
		if (n = = 0 && m = = 0) break;
		Memset (Dp,0,sizeof (DP));
		DP[1] = 1;
		for (int i = 1, i < n; i++) for
			(int j = 1; j <= M; j + +)
			{
				int k = i + j;
				Dp[k] + = Dp[i];
			}
		cout << Dp[n] << Endl;
	}
	return 0;
}