POJ-1942 Paths on a Grid
来源:互联网 发布:汽车cae分析软件 编辑:程序博客网 时间:2024/04/29 20:08
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 24046 Accepted: 5947
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?
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
Source
Ulm Local 2002
#include <cstdio>#include <iostream>using namespace std;long long a,b;long long c(long long x,long long y){if(y > x/2) y = x-y;long long ans = 1;for(long long i = 1;i <= y;i++) ans=ans*(x-i+1)/i;return ans;}int main(){while(cin>>a>>b && (a || b)){cout<<c(a+b,a)<<endl;}}
0 0
- 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
- POJ 1942 Paths on a Grid (水题)
- POJ 1942:Paths on a Grid
- POJ 1942 Paths on a Grid
- 【POJ 1942】 Paths on a Grid
- Paths on a Grid(POJ--1942
- 千里之行始于足下
- 如何搭建LNMP环境
- 【Android 应用开发】GitHub 优秀的 Android 开源项目
- 【DFS】HDU1584蜘蛛牌
- java.线程的五个状态与之间的切换
- POJ-1942 Paths on a Grid
- 高级搜索题集
- POJ 2488 A Knight's Journey
- modelsim-win64-10.1c 下载、安装、破解全攻略
- 图像分割—基于图的图像分割(Graph-Based Image Segmentation)
- 万年历(含农历)
- NKOI 2151 烽火传递
- WebView的简单使用以及属性介绍
- Oracle学习笔记(十六)——数据字典和动态性能视图