WAYS - PATHS
Problem Statement:
Consider a square matrix of order m(m rows and m columns). At each step you can move one step to the right or one step to the top. How many possibilities are to reach (m,m) from (0,0)?
Input:
The first line consists of an integer t, the number of testcases. Each testcase consists of a single integer m, the order of square matrix.
Output:
For each case print the number of possibilities of reaching the point (m,m) from (0,0)
Input Constraints:
1<=t<=10
1<=m<=14
Example:
Sample Input:
3
1
2
3
Sample Output:
2
6
20
Explanation of test case #2:
There are 6 possible ways of reaching (2,2) from (0,0)
See Also : WAYS (No source limit)
hide comments
cegprakash:
2012-10-28 02:06:11
for now the record is 82 characters in C++. Last edit: 2011-04-08 02:50:36 |
Added by: | cegprakash |
Date: | 2011-03-06 |
Time limit: | 0.100s |
Source limit: | 120B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | C C++ 4.3.2 CPP JAVA |