首页 > 其他 > 详细

HDU - 1723 - Distribute Message

时间:2014-03-01 19:22:38      阅读:498      评论:0      收藏:0      [点我收藏+]

先上题目:

Distribute Message

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


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
 
  
 
 
上代码:
 
bubuko.com,布布扣
 1 #include <cstdio>
 2 #include <cstring>
 3 #define MAX 32
 4 #define LL long long
 5 using namespace std;
 6 
 7 LL dp[MAX];
 8 
 9 int main()
10 {
11     int n,m;
12     while(scanf("%d %d",&n,&m),(n+m)){
13         memset(dp,0,sizeof(dp));
14         dp[1]=1;
15         for(int i=1;i<=n;i++){
16             for(int j=1;j<=m && i+j<=n;j++){
17                 dp[i+j]+=dp[i];
18             }
19         }
20         printf("%I64d\n",dp[n]);
21     }
22     return 0;
23 }
1723

 

HDU - 1723 - Distribute Message,布布扣,bubuko.com

HDU - 1723 - Distribute Message

原文:http://www.cnblogs.com/sineatos/p/3574500.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!