HDU——1133 Buy the Ticket

最新推荐文章于 2024-07-25 16:30:00 发布

weixin_34239169

最新推荐文章于 2024-07-25 16:30:00 发布

阅读量44

点赞数

CC 4.0 BY-SA版权

文章标签： java

原文链接：http://www.cnblogs.com/z360/p/7338322.html

此问题是关于 Harry Potter 的疯狂粉丝如何成功购买电影票。粉丝们排队购票，但只接受50美元和100美元钞票。售票处初始没有现金储备。问题在于计算有多少种不同的排队方式能确保从第一个人到最后一个人购票过程不会因为找不开零钱而中断。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

　　　　　　　　　　　　　　　　Buy the Ticket

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

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: 1267 1297 2067 1143 1715

转载于:https://www.cnblogs.com/z360/p/7338322.html