## Grid Paths

View as PDF

Points: 10 (partial)
Time limit: 2.0s
Memory limit: 64M

Author:
Problem type

In a grid of size by , you are to determine the amount of paths from the square to the square that do not go through blocked off squares only moving to the right or up. .

#### Input Specification

The first line will contain three integers, , , and .

The next lines will contain two integers and .

#### Output Specification

On one line, you are to output the number of valid paths through the grid modulo .

#### Sample Input

4 4 0

#### Sample Output

20

• commented on Jan. 30, 2020, 1:51 p.m.

This comment is hidden due to too much negative feedback. Click here to view it.

• commented on Feb. 2, 2020, 10:35 a.m.

Have you looked at the constraints? They're nowhere near similar

• commented on Jan. 30, 2020, 6:59 p.m.

Well you can't solve either, so does it really matter?

• commented on Dec. 24, 2019, 2:38 p.m.

Seems to be an easier version of https://codeforces.com/contest/559/problem/C.

Interesting problem though!