POJ 1942 Paths on a Grid
来源:互联网 发布:租房上哪个网站好 知乎 编辑:程序博客网 时间:2024/05/16 19:13
Paths on a Grid
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18725 Accepted: 4515
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 <stdio.h>#include <string.h>#include <math.h>int main(){ long long int f(long long int m,long long int n); int i,j,t; long long int s,n,m; while(scanf("%lld %lld",&n,&m)!=EOF) { if(!n&&!m) { break; } if(n<m) { s=f(n,n+m); }else { s=f(m,n+m); } printf("%lld\n",s); } return 0;}long long int f(long long int m,long long int n){ long long int i,j; long long int res; double s; s=1.0; for(i=n,j=m;i>=n-m+1;i--,j--) { s=s*(double)i/(double)j; } res=(long long int)(s+0.01); return res;}
- 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
- HDOJ1326 Box of Bricks
- 一个普通码农所体会的程序之道
- Struts2中的ModelDriven机制
- LA 3177 长城守卫(推理+二分)
- [面试] 递归 反向输出链表 ,定义一个求字符串长度的函数, 反向输出字符串. 不能再函数内部定义变量.
- POJ 1942 Paths on a Grid
- qsort的使用小结
- 杭电 1850
- 【MFC/C++操作word】Word篇
- Fedora18博通430g电信无线拨号上网
- sort使用小结
- Java周边小知识--md5加密算法的Java实现类
- spring,hiberante之*** is not valid without active transaction
- Android--Alarm,定时闹钟