WAYS3 - PATHS( no source code limit)

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 there 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)


Added by:cegprakash
Date:2011-05-22
Time limit:0.100s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All

hide comments
2020-07-04 13:37:05
Matrix has m+1 rows and m+1 columns. Score is size of the source.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.