WAYS - PATHS
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)?
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.
For each case print the number of possibilities of reaching the point (m,m) from (0,0)
Explanation of test case #2:
There are 6 possible ways of reaching (2,2) from (0,0)
See Also : WAYS (No source limit)
use C brothers, default declaration types
101B in C...
How can people can do in just 77B !!! Just somehow reached 107B.
I was thinking of a DP solution and then found the source limit ..Read some stuff and realized it can be solved using combinatorics..
got every test case right from 1 to 14 ... but still getting WA ,,,. somebody help ...please!!
Are you mad :(
Yes!! 107 bytes!!
BOKAM VINAY KUMAR:
yo finally done :)
Finally made it!!! 109B! :)
din like bit constraint much!