程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> DP HDU 1723

DP HDU 1723

編輯:C++入門知識

DP HDU 1723


簡單的DP

Distribute Message

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


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 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

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

Author 威士忌
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define MAXN 35
int dp[MAXN];

int main(){
    int n,m;
    int i,j;

    while(~scanf("%d%d",&n,&m)){
        if(n==0 && m==0){
            break;
        }
        memset(dp,0,sizeof(dp));
        dp[1] = 1;
        for(i=1;i<=n;i++){
            for(j=1;j<=m;j++){
                if((i+j)<=n){
                    dp[i+j] = dp[i+j]+dp[i];
                }
            }
        }
        printf("%d\n",dp[n]);
    }

    return 0;
}


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved