Given an input, calculates the number of minimum paths from a source to a destination in some fiction city
Given a city with x*y dimensions and e blocked corners, the task is to find the number of minimum paths. Input file is written as follows: First, k indicates number of instances. Then, for each instance is given: x*y city dimensions, e blocked corners, e lines with coordinates to blocked corners, c target corners, and c lines with coordinates to target corners.
$ ./paths input_file output_file