WAYS - PATHS

no tags 

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
darthcoder3200: 2019-06-24 22:47:07

use C brothers, default declaration types

e869120: 2016-07-24 10:20:34

101B in C...

gaurav117: 2016-03-08 15:31:33

How can people can do in just 77B !!! Just somehow reached 107B.

dwij28: 2016-01-20 16:58:22

I was thinking of a DP solution and then found the source limit ..Read some stuff and realized it can be solved using combinatorics..

NEO: 2015-07-11 17:30:32

got every test case right from 1 to 14 ... but still getting WA ,,,. somebody help ...please!!

jone30rw: 2015-07-05 21:50:52

Are you mad :(
only
public class .... public static void main
take more than 120B
remove JAVA from languages or the 120B Limit.

Hugo Godoy: 2014-09-15 07:52:06

Yes!! 107 bytes!!

BOKAM VINAY KUMAR: 2014-06-02 11:18:20

yo finally done :)

RIVU DAS: 2014-06-02 08:16:22

Finally made it!!! 109B! :)

Rishav Goyal: 2014-02-27 20:31:00

din like bit constraint much!


Added by:cegprakash
Date:2011-03-06
Time limit:0.100s
Source limit:120B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:C CPP C++ 4.3.2 JAVA