Poj1942--Paths on a Grid(组合数)

时间：2015-09-26 17:09:48 阅读：160 评论：0 收藏：0 [点我收藏+]

标签：

Paths on a Grid

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 23227		Accepted: 5726

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

看了这个题，才感觉世界真是奇妙。还以为是搜索，但好像没办法标记找到的路径。然后一不小心就知道了是个组合数。然后超时。然后知道了__int64的强大之处。哎，水题不水，自有它的奥妙。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
__int64 n, m;
void Deal(__int64 a, __int64 b)
{
    if(b > a - b)
        b = a - b;
    __int64 Temp = b, ans = 1;
    while(Temp--)
    {
        ans *= a--;
        while(ans % b == 0 && b > 1)
        {
            ans /= b--;
        }
    }
    printf("%I64d\n", ans);
} 
int main()
{
    while(~scanf("%I64d%I64d", &n, &m), n+m)
    {
        Deal(n+m, n);
    }
    return 0;
}

Poj1942--Paths on a Grid(组合数)

标签：

原文地址：http://www.cnblogs.com/fengshun/p/4840895.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行