USACooverfencing Solution description in the fields outside, Farmer John, built a huge fenced maze. Fortunately, he set aside in the maze of border export of two fence maze. Fortunately, that he had built the labyrinth is a " perfect" maze: from any point in the maze to find a way out of the maze. To the maze-set the width of the W (1 < = W < = 38) and height H (1 < = H < = 100).* H+1 line, the character of each line* W+1 a maze in the format given below. And then calculate the most from the maze of " bad" a point out of the maze required number of steps (from " bad" , the minimum number of steps out of the labyrinth). (From this point the best way to the nearest export, it still needs the most number of steps) Of course, cattle are only level or vertically in the X or Y axis move, they do not have to go diagonal . Squares counted every move to a new step (including that step out of the maze) This is a W = 5, H = 3 of the maze:

overfencing.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．