POJ 1942 Paths on a Grid 组合以及处理阶乘

点击打开链接

Paths on a Grid

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 20387		Accepted: 4980

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

Source

Ulm Local 2002

题意是说给你一个n*m的矩形网格，让你求出从最左下角走到最右上角有多少种方案。只能往左或者往右走，而且每次只能走一步。

从左下角到右上角肯定横着要走m步，竖着要走n步。一共要走n+m步，那么就从这n+m步中选择n步往上走，m步往右走，就是组合问题，C(n+m,n)或则C(n+m,m).

但是题目中给的题目数量很大，所以如果直接模拟阶乘(n+m)!/(n!*m!)肯定不行。所以要拆分阶乘，逐项相除，再乘以前面所有项之积。

//388K	0MS	
#include<stdio.h>
unsigned C(unsigned n,unsigned m)
{
    double mul=1.0;
    while(m>0)
        mul*=((double)n--)/((double)m--);
    mul+=0.5;//防止double转换成unsigned的时候强制截断小数，必须进行四舍五入
    return (unsigned)mul;
}
int main()
{
    unsigned n,m;
    while(scanf("%u%u",&n,&m),n|m)
    {
        unsigned min=n<m?n:m;
        unsigned a=n+m;
        printf("%u\n",C(a,min));
    }
    return 0;
}