HDU——1133 Buy the Ticket

时间：2017-08-10 13:45:17 阅读：209 评论：0 收藏：0 [点我收藏+]

标签：mil contain show ota last iss other get input

　　　　　　　　　　　　　　　　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

HDU——1133 Buy the Ticket

标签：mil contain show ota last iss other get input

原文地址：http://www.cnblogs.com/z360/p/7338322.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行