zoukankan      html  css  js  c++  java
  • Poj1942--Paths on a Grid(组合数)

    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)2=a2+2ab+b2). 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

     
    看了这个题, 才感觉世界真是奇妙。 还以为是搜索, 但好像没办法标记找到的路径。 然后一不小心就知道了是个组合数。 然后超时。 然后知道了__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
    ", ans);
    } 
    int main()
    {
        while(~scanf("%I64d%I64d", &n, &m), n+m)
        {
            Deal(n+m, n);
        }
        return 0;
    }
     
     
  • 相关阅读:
    javascript 字符串与正则
    微信小程序 实现三级联动-省市区
    VUE图片懒加载-vue lazyload插件的简单使用
    移动端使用mint-ui loadmore实现下拉刷新上拉显示更多
    vue-cli创建的项目中引入第三方库报错 'caller', 'calle', and 'arguments' properties .....报错问题
    js判断两个数组是否相等
    234回文链表
    剑指 Offer 22. 链表中倒数第k个节点
    返回倒数第 k 个节点
    leetcode 179.最大数
  • 原文地址:https://www.cnblogs.com/soTired/p/4840895.html
Copyright © 2011-2022 走看看