Just a small doubt regarding this problem.
Can anyone tell me why we are choosing m moves from a total of (n+m) moves to reach coordinate (x, y)?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Name |
---|
Suppose our coordinate is (x, y). Every time we move, we increase x + y by 3.
Thus, we will make (x + y) / 3 moves in order to reach (x, y).
Every time we move 1 tile right and 1 tile down. We don't choose that. What we choose is if we move 1 extra tile right or 1 extra tile down.
Suppose (x + y) / 3 = k. Then we need to choose to move extra tile down x — k times and extra tile right the rest of the times (which is equal to y — k times).
Now we're just left to choose which exactly times we will choose to go down. We can choose any set of x — k turns of total k turns. So the answer is either 0 or C_k_(x-k).