2.12(Zju2061 Buy the Ticket)

http://noi.openjudge.cn/ch0206/9288/

描述

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.
 

样例输入

3 0
3 1
3 3
0 0

样例输出

6
18
180

翻译:

《哈利波特与火焰杯》将在未来几天展出。作为一个疯狂的哈利波特迷，你会去电影院看第一眼的，不是吗?

假设电影院只有一个售票处，每张票的价格是50美元。买票的队伍由m + n人组成(m人每人只有50美元纸币，n人每人只有100美元纸币)。

现在的问题是计算从第一个人到最后一个人购买过程不会被停止的队列的不同方式的数量。
注意:起初售票处是没有钱的。

如果售票处没有50美元，但排在前面的人手里只有100美元，购票过程就会停止。

输入:

输入文件包含几个测试用例。每个测试用例由两个整数组成:m和n。它以m = n = 0结束。否则，m, n <=100。

输出:

对于每个测试用例，首先在一行中打印测试号(从1开始计数)，然后在另一行中输出不同方法的数量。

样例输入

3 0
3 1
3 3
0 0

样例输出

6
18
180