Description: Input: The first line is the three positive integers, m (1 ≤ m ≤ 100), n (1 ≤ n ≤ 100), D (1 ≤ D ≤ 100). That wilderness is m* n matrix, Fario maximum flight distance of D. The next m lines with n characters per line, with no spaces between each other. P indicates the current position is flat, L indicates the lake. Assume that (1,1) and (m, n) must be flat. Output: An integer representation of Leo the minimum time required to reach base. If you can not reach the base, then the output impossible.
To Search:
File list (Check if you may need any files):
flyaway.cpp
Download