DCP-61: Drive In Grid Back to All Problems

Easy Math > Combinations and Permutations


In a city like New York, the roads are arrange in grid like pattern. Roads are also arranged in one way direction and you can only move right or down and never left or up. One such travel from point A to point B can be illustrated in the following picture: ![enter image description here][1] So we can see it took 11 steps to reach from point A to point B. However in our problem today, we will like to find out in how many ways we can reach from point A to point B. Input: ------ Input starts with an integer **T (1<= T <=100)**, denoting the number of test cases. Each case contains two integers **X (3 ≤ X ≤ 15)** and **Y (3 ≤ Y ≤ 15)** denoting the width and height of the grid. Output: ------- For each case of input, output the one integer **R** in a line, denoting the result - number of possible ways to reach B from A, where A is topmost and leftmost point in the grid and B is the bottom most and rightmost point in the grid. Sample Input ------------ 2 6 5 4 4 Sample Output ------------- 462 70 [1]: https://s3-ap-southeast-1.amazonaws.com/devskillimagestorage/questionimages/47ee783a-b6f1-c245-8448-08d34fbf5585_ee68b0c85e324c16b64640496b141deb_W351xH293.png


Problem Setter:

MD. Jalal Uddin

Please login to submit solution to this problem.

Problem Limits

Language Time Limit (seconds)
C 1.00
C++ 1.00
C++14 1.00
C# 2.00
Go 2.00
Java 2.00
JavaScript 2.00
Objective-C 2.00
Perl 2.00
PHP 2.00
Python 2.00
Python3 2.00
Ruby 2.00
VB.Net 2.00

Problem Stats

69/114

Solve/Submission

Ranking

# User Language Timing
01 nasir_32_15 Cpp14 0.00s
02 ash12 Cpp14 0.00s
03 MAHRahat Cpp14 0.00s
04 tariqiitju Cpp 0.00s
05 7Mahfuz Cpp14 0.00s
06 uzzal_rahman Cpp 0.00s
07 r13ayan Cpp 0.00s
08 feodorv C 0.00s
09 seyedssz Cpp14 0.00s
10 sadia2427 Cpp14 0.00s
11 pulak_ict_mbstu Cpp 0.00s
12 SakibAlamin Cpp14 0.00s
13 nazmul_bzs Cpp14 0.00s
14 smriad Cpp14 0.00s
15 Bruteforcekid Cpp 0.00s
16 abdulmukit Cpp 0.00s
17 Morass Cpp14 0.00s
18 ikaadil Cpp 0.00s
19 Robbinb1993 Cpp 0.00s
20 prateepm Cpp14 0.00s
21 rayhan50001 Cpp14 0.01s
22 mahmud2690 Cpp 0.01s
23 lightlessShadO Cpp14 0.01s
24 mahbub07 Cpp14 0.01s
25 emrul Cpp14 0.01s
26 shawon100 Cpp 0.01s
27 masba Python 0.02s
28 joy25896 Cpp14 0.03s
29 haasib Cpp14 0.07s
30 Ishrak Cpp14 0.08s
31 jahirtheboss Cpp14 0.09s
32 RandyWaterhouse Python3 0.15s
33 ImagineWarrior Cpp14 0.21s
34 bhagyo Cpp14 0.33s
35 mamun4122 Cpp14 0.36s
36 rajdipsaha Cpp14 0.39s
37 njrafi Cpp14 0.39s
38 sahedsohel Cpp14 0.47s
39 arsho Cpp14 0.48s
40 anowar1112 Cpp14 0.48s
41 Mahmudul_Tushar Cpp14 0.48s
42 ssavi Cpp14 0.48s
43 rofi93 Cpp14 0.48s
44 murad_al_wajed Cpp14 0.49s
45 sayedgkm Cpp14 0.49s
46 Ihtiaz Cpp14 0.49s
47 fsshakkhor Cpp14 0.49s
48 darkprinx Cpp14 0.49s
49 rafsan_rana Cpp14 0.49s
50 faisalxn Cpp14 0.49s
Feedback

Your feedback is our precious!



Or call +88 02 9853138 for support