|
||||||||||
Distribute MessageTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2804 Accepted Submission(s): 1406 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
Sample Output
Hint 4 1 : A->B->C->D 4 2 : A->B->C->D, A->C->D, A->B->D Author ÍþÊ¿¼É Source | ||||||||||
|