poj 1942 : Paths on a Grid (排列组合)
来源:互联网 发布:期货升贴水原因知乎 编辑:程序博客网 时间:2024/05/16 17:33
Paths on a Grid
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%lld & %lluDescription
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=a 2+2ab+b 2). 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?
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 41 10 0
Sample Output
1262
从左下角到右上角,共有n+m步,然后判断什么时候右拐,什么时候左拐,排列组合算法
#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;int main(){ long long n, m; long long i, j, ans; while(scanf("%lld%lld",&n,&m)&&n||m){ if (n > m)swap(n,m); ans = 1; for (i = 1; i <= n; i++){ j = i + m; ans = ans * j / i; } printf("%lld\n", ans); } }
0 0
- poj 1942 : Paths on a Grid (排列组合)
- 排列组合 poj Paths on a grid
- POJ 题目1942 Paths on a Grid(排列组合,水)
- poj 1942 Paths on a Grid 简单排列组合 + unsigned long long 使用方法
- poj1942 Paths on a Grid 【排列组合】
- poj 1942 Paths on a Grid
- POJ 1942 Paths on a Grid
- POJ 1942 Paths on a Grid .
- POJ 1942 Paths on a Grid
- poj 1942 Paths on a Grid
- POJ 1942 Paths on a Grid
- POJ 1942 Paths on a Grid
- POJ 1942 Paths on a Grid
- POJ 1942 Paths on a Grid
- POJ 1942 Paths on a Grid
- poj 1942Paths on a Grid
- POJ 1942--Paths on a Grid
- poj 1942 Paths on a Grid
- 破解教程大全
- java数据结构-图的实现 采用数组和邻接矩阵
- 学习笔记之堆内存和栈内存的区别
- JAVA序列化
- C++编程入门系列之十六(类与对象:类模板)
- poj 1942 : Paths on a Grid (排列组合)
- C++容器
- linux RTC 驱动模型分析
- angularjs表单验证
- Python 更加抽象
- selenium环境搭建
- 236. Lowest Common Ancestor of a Binary Tree
- javaWeb项目的classpath说明
- java数据结构-说明