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 | 3687 |

2 | ecnerwala | 3668 |

3 | Benq | 3503 |

4 | ksun48 | 3421 |

5 | Um_nik | 3412 |

6 | Radewoosh | 3382 |

7 | maroonrk | 3323 |

8 | ainta | 3318 |

9 | Itst | 3239 |

10 | apiadu | 3238 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 204 |

2 | SecondThread | 200 |

3 | Monogon | 196 |

4 | vovuh | 189 |

5 | Um_nik | 187 |

6 | pikmike | 186 |

7 | antontrygubO_o | 184 |

8 | Ashishgup | 180 |

9 | pashka | 169 |

10 | rng_58 | 165 |

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/02/2020 06:36:56 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

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