hdu 1133 Buy the Ticket (大数+递推)

Buy the Ticket

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4185    Accepted Submission(s): 1759

Problem Description

The "Harry Potter and the Goblet of Fire" will be on show in the next few days. As a crazy fan of Harry Potter, you will go to the cinema and have the first sight, won’t you?

Suppose the cinema only has one ticket-office and the price for per-ticket is 50 dollars. The queue for buying the tickets is consisted of m + n persons (m persons each only has the 50-dollar bill and n persons each only has the 100-dollar bill).

Now the problem for you is to calculate the number of different ways of the queue that the buying process won't be stopped from the first person till the last person. 
Note: initially the ticket-office has no money.

The buying process will be stopped on the occasion that the ticket-office has no 50-dollar bill but the first person of the queue only has the 100-dollar bill.

 

Input

The input file contains several test cases. Each test case is made up of two integer numbers: m and n. It is terminated by m = n = 0. Otherwise, m, n <=100.

 

Output

For each test case, first print the test number (counting from 1) in one line, then output the number of different ways in another line.

 

Sample Input

3 0

3 1

3 3

0 0

 

Sample Output

Test #1:

6

Test #2:

18

Test #3:

180

 

Author

HUANG, Ninghai

 

Recommend

Eddy   |   We have carefully selected several similar problems for you:  1715 1207 1865 1284 1753 

 

简单题。推出递推公式就差不多了。

 //0 MS    324 KB    Visual C++
 /*

     递推公式：
         ans[n][m]=(n+m)!*(n-m+1)/(n+1);
 */
 #include<stdio.h>
 #include<string.h>
 #define N 10000
 int f[][]={};
 void mul(int a[],int n)
 {
     int temp=;
     for(int i=;i<;i++){
         temp+=n*a[i];
         a[i]=temp%N;
         temp/=N;
     }
 }
 void div(int a[],int n)
 {
     int temp=;
     for(int i=;i>=;i--){
         temp=temp*N+a[i];
         a[i]=temp/n;
         temp%=n;
     }
 }
 void init()
 {
     f[][]=;
     for(int i=;i<=;i++){
         memcpy(f[i],f[i-],*sizeof(int));
         mul(f[i],i);
     }
 }
 int main(void)
 {
     int n,m,k=;
     init();
     while(scanf("%d%d",&n,&m),n+m)
     {
         printf("Test #%d:\n",k++);
         if(m>n){
             puts("");continue;
         }
         int ans[];
         memcpy(ans,f[n+m],*sizeof(int));
         mul(ans,n-m+);
         div(ans,n+);

         int i=;
         for(;!ans[i];i--);
         printf("%d",ans[i]);
         while(i--) printf("%04d",ans[i]);
         printf("\n");
     }
     return ;
 }