HDU-1133-Buy the Ticket
发布时间:2020-12-14 02:58:23 所属栏目:大数据 来源:网络整理
导读:Buy the Ticket Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4720????Accepted Submission(s): 1992 Problem Description The "Harry Potter and the Goblet of Fire" will be on show in t
Buy the TicketTime Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4720????Accepted Submission(s): 1992
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
?
Sample Output
(编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |