hdu Paths on a Grid (组合数的模板题)-CSDN博客

博客围绕hdu的Paths on a Grid组合数模板题展开，给出问题描述、输入输出要求及示例。输入为表示矩形大小的两个无符号32位整数n和m，输入以n=m=0结束，需输出网格中向右或向上移动的不同路径数量，并给出了相应的代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description

Imagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago (this time he's explaining that (a+b)²=a²+2ab+b²). So you decide to waste your time with drawing modern art instead.

Fortunately you have a piece of squared paper and you choose a rectangle of size n*m on the paper. Let's call this rectangle together with the lines it contains a grid. Starting at the lower left corner of the grid, you move your pencil to the upper right corner, taking care that it stays on the lines and moves only to the right or up. The result is shown on the left:

Really a masterpiece, isn't it? Repeating the procedure one more time, you arrive with the picture shown on the right. Now you wonder: how many different works of art can you produce?

Input

The input contains several testcases. Each is specified by two unsigned 32-bit integers n and m, denoting the size of the rectangle. As you can observe, the number of lines of the corresponding grid is one more in each dimension. Input is terminated by n=m=0.

Output

For each test case output on a line the number of different art works that can be generated using the procedure described above. That is, how many paths are there on a grid where each step of the path consists of moving one unit to the right or one unit up? You may safely assume that this number fits into a 32-bit unsigned integer.

Sample Input

5 4 1 1 0 0

Sample Output

126 2

*****************************************************************************************************************************************************************************************************************

 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <string>
 4 #include <stdlib.h>
 5 #include <map>
 6 #include <cmath>
 7 #include <algorithm>
 8 
 9 using namespace std;
10 
11 unsigned ms(unsigned x, unsigned y)
12 {
13     unsigned a = x+y;
14     unsigned b = min(x,y);
15     double t = 1.0;
16     while(b > 0)
17     {
18         t *= (double)(a--)/(double)(b--);
19     }
20     t += 0.5;//很重要
21     return (unsigned)t;
22 }
23 
24 int main()
25 {
26     int n, m;
27     while(~scanf("%d %d",&n, &m))
28     {
29         if(n == 0 && m == 0)
30             break;
31         cout <<ms(n,m)<<endl;
32     }
33     return 0;
34 }