Distribute Message （HDU 1723）

Distribute Message

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1311    Accepted Submission(s): 604

Problem Description

The contest’s message distribution is a big thing in prepare. Assuming N students stand in a row, from the row-head start transmit message, each person can transmit message to behind M personals, and how many ways could row-tail get the message?

Input

Input may contain multiple test cases. Each case contains N and M in one line. (0<=M<N<=30)
When N=0 and M=0, terminates the input and this test case is not to be processed.

Output

Output the ways of the Nth student get message.

Sample Input

  
  

   
   4 1
4 2
0 0
  
  

Sample Output

  
  

   
   1
3


   
   

    
    

     
     Hint
    
    
4 1 : A->B->C->D
4 2 : A->B->C->D, A->C->D, A->B->D

   
   
   
    
  
  

 

这道题是我为数不多完全自己想出来的DP题啊，虽然很水，但还是要纪念一下！（难道我突然顿悟了DP的精髓么，哈哈）

#include<stdio.h>
int main()
{
    int n, m, i, j, dp[50];

    while(~scanf("%d%d", &n,&m), n+m)
    {
        for(i=1; i<=n; i++)
        {
            dp[i] = (i == 1 ? 1 : 0);
            for(j=i-1; j>=1 && j>=i-m; j--)
                dp[i] += dp[j];
        }
        printf("%d\n", dp[n]);
    }
    return 0;
}