2.6英文题面翻译

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.

输入

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.
 

输出

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.

OpenJudge - 9288:Zju2061 Buy the Ticket

翻译

描述

电影《哈利波特与火焰杯》马上就要上映了，作为哈利波特的狂热粉丝，你一定会去看首映的，对吧？

假设电影院只有一个售票窗口，每张票的价格是五十美元，排队买票的人一共有m+n个（m个只有五十美元钞票，n个只有一百美元钞票）。

现在你的任务是，计算一共有多少种不同的排队方法，可以让售票队伍从头到尾不被打断（最开始时售票窗口内没有钱可找零）。

当售票窗口内没有五十美元可以找零，而队列此时的第一个人只拥有一百美元时，售票将会被打断。

输入

输入包含多组测试数据，每组测试数据包含两个整数m和n，当m=n=0时输入结束，否则 m, n <=100。

输出

对于每组测试数据，先输出一行测试行号（从1开始），再另起一行输出总共的方法数。