【ECJTU_ACM 11级队员2012年暑假训练赛（8） A Paths on a Grid】

A - Paths on a Grid

Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 1942

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)²=a²+2ab+b²). 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

 1 // Project name : A
 2 // File name    : main.cpp
 3 // Author       : iCoding
 4 // E-mail       : honi.linux@gmail.com
 5 // Date & Time  : Fri Aug 10 13:36:56 2012
 6 
 7 
 8 #include <iostream>
 9 #include <stdio.h>
10 #include <string>
11 #include <cmath>
12 #include <algorithm>
13 using namespace std;
14 
15 /*************************************************************************************/
16 /* data */
17 
18 
19 /*************************************************************************************/
20 /* procedure */
21 
22 typedef long long int longint;
23 
24 longint iMin(longint a, longint b)
25 {
26     return a > b ? b : a;
27 }
28 
29 longint iCalCou(longint num, longint a)
30 {
31     /*longint up[1000];
32     longint down[1000];
33     for (int i = 0; i < a; i++)
34     {
35         up[i] = num - i;
36         down[i] = i + 1;
37     }
38     */
39     longint iAnswer = 1;
40     for (int i = 0; i < a; i++)
41     {
42         iAnswer *= (num - i);
43         iAnswer /= (i + 1);
44     }
45 
46     return iAnswer;
47 }
48 /*************************************************************************************/
49 /* main */
50 int main()
51 {
52     longint n, m;
53     while(cin >> n >> m && n + m)
54     {
55         cout << iCalCou(n + m , iMin(n,m)) << endl;
56     }
57     return 0;
58 }
59 // end 
60 // Code by Sublime text 2
61 // iCoding@CodeLab

后来想了想，，这个题目还是有另外的方法，不过一看数据量，，顿时崩溃。。

 1 #include <iostream>
 2 using namespace std;
 3 
 4 #ifndef MAXN
 5 #define MAXN 1000
 6 #endif
 7 
 8 int iMap[MAXN][MAXN];
 9 
10 int main()
11 {
12     int n, m;
13     while (cin >> n >> m && n + m)
14     {
15         for (int j = 0; j <= m; j++)
16         {
17             iMap[0][j] = 1;
18         }
19         for (int i = 0; i <= n; i++)
20         {
21             iMap[i][0] = 1;
22         }
23         for (int i = 1; i <= n; i++)
24         {
25             for (int j = 1; j <= m; j++)
26             {
27                 iMap[i][j] = iMap[i-1][j] + iMap[i][j-1];
28             }
29         }
30 
31         cout << iMap[n][m] << endl;
32     }
33     return 0;
34 }
35 
36 // end 
37 // ism