ACM 递推.doc

ACM训练赛--递推专题?? 1001: Buy the Ticket 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 wont 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 Source HUANG, Ninghai ?题目分析： ? 题目大意： 电影院买票，收银台没有零钱，而排队买票的人手里拿着的都是100元或是50元，每张票50元，给出拿100或50的各自人数，求出有几种排列方法使得收银台不会因找不出钱而停止！ ? 思路： 设m张50元n张100元时的排列方法有f(m,n)种，总人数为m+n；当总人数为m+n-1时，有两种情况： （1）m少1。此时必须要满足mn(若m=n，则m-1 P （2）n少1。排列方法有f(m,n-1)种。当n-1多1时，同理有n*f(m,n-1)种方法。 由以上两种情况得到递推公式： 当m=n时，f(m,n)=n*f(m,n-1); 当mn时，f(m,n)=m*f(m-1,n)+n*f(m,n-1)； 当mn时，f(m,n)=0. 下一步就要确定初始条件： 当m=1, n=0时，f(m,n)=1; 当m=1, n=1时，f(m,n)=1. 另外，由于本题的数据比较大，必须要用高精度，而且递归会超时，要用数组来保存数据。那么，选用哪种类型的数组比较好呢？很显然，本题涉及到很大的运算量，用整型的数组比较好。于是，用f[m][n][]代表f(m,n)。 ? 代码： ? #includestdio.h #define c 51????????????????????? //定义数组的长度 #define d 100000000??????? //定义常量，用于整型数组的数据处理 int main() { ??? int m,n,i,j,k,t=1,temp=0,f1,f2; ??? __int64 ff; ??? int f[101][101][c]={0};??????????????????????//数组初始化为0 ??? f[1