杭电1133 Buy the Ticket（大数，递推）

最新推荐文章于 2020-02-20 22:33:21 发布

Scarlett在努力

最新推荐文章于 2020-02-20 22:33:21 发布

阅读量743

点赞数

分类专栏：大数 hdu 文章标签：解题报告杭电递推简单dp 大数

本文链接：https://blog.csdn.net/Scarlett_geng/article/details/47343051

版权

这篇博客详细介绍了杭电1133题目的解题思路，主要涉及大数处理和递推算法。通过示例输入和输出，展示了问题的解决过程，适合初学者理解简单DP问题。

摘要由CSDN通过智能技术生成

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.