POJ 1942 Paths on a Grid
来源:互联网 发布:.me域名的市场 编辑:程序博客网 时间:2024/05/16 15:35
本来以为是一套高中的数学题,以为找出公式就ok了,结果。。排列还超时。。。另外。。。就是排列要用到double。。。。
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 41 10 0Sample Output
1262
#include<stdio.h>int main(){ unsigned int n,m; unsigned int i,j,t; double sum; while(scanf("%d %d",&n,&m),n+m){ if(n>m){ t=m; m=n; n=t; } m=n+m; sum=1; t=m-n; for(i=m,j=1;i>t && j<=n;--i,j++){//其实从小的开始乘、除,就必定整除!! sum=sum*(double)i/(double)j; } printf("%.f\n",sum); } return 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
- ORACLE-SQL优化(2)
- python的web.py框架
- 生活在 Emacs 中
- 对c++的一些理解
- CUE文件制作详解
- POJ 1942 Paths on a Grid
- SQL级联删除——删除主表同时删除从表——同时删除具有主外键关系的表
- 对话框扩展 OnCreate OnInitialDialog 控件焦点,按键回车变化
- hdu 3848 CC On The Tree
- hdu 1003
- C语言编译过程总结详解
- 程序2011.8.6
- hibernate 中更新某些字段的几种update方法
- 思想与命运的互动